|
== Referências ==
* [[Stephen Cook|Stephen A. Cook]] ande Robert A. Reckhow (1972), ''Time-bounded random access machines'', Journal of Computer Systems Science 7 (1973), 354-375.
* [[Calvin Elgot]] ande [[Abraham Robinson]] (1964), ''Random-Access Stored-Program Machines, an Approach to Programming Languages'', Journal of the Association for Computing Machinery, Vol. 11, No. 4 (October, 1964), pp. 365-399.
*[[Peter van Emde Boas]], ''Machine Models and Simulations'', pp. 3-66, located in:
**[[Jan van Leeuwen]], ed. ''Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity'', The MIT Press/Elsevier, 1990. ISBN 0-262-72014-0 (volume A). QA76.H279 1990.
* [[J. Hartmanis]] (1971), "Computational Complexity of Random Access Stored Program Machines," Mathematical Systems Theory 5, 3 (1971) pp. 232-245.
* Kaphengst, Heinz, ''Eine Abstrakte programmgesteuerte Rechenmaschine''', Zeitschrift fur mathematische Logik und Grundlagen der Mathematik:''5'' (1959), 366-379.
* {{cite book|author = [[John Hopcroft]] ande [[Jeffrey Ullman]] | year = 1979| title = Introduction to Automata Theory, Languages and Computation| publisher = Addison–Wesley, Reading Mass| edition = 1st | isbn = 0-201-02988-X.}}
* {{cite book | last = Hopcroft | first = John E.| coauthors = Rajeev Motwani, Jeffrey D. Ullman| title = Introduction to Automata Theory, Languages, and Computation| edition = 2nd | publisher = Addison–Wesley | location = Reading Mass | year = 2001 | isbn = 0-201-44124-1}}
* [[Joachim Lambek]] (1961, receivedrecebido em 15 Junede Junho de 1961), ''How to Program an Infinite Abacus'', Mathematical Bulletin, vol. 4, no. 3. September 1961 pages 295-302.
* [[A.Andrei A.Markov|Andrey Markov]] (1954) ''Theory of algorithms''. [Translated by Jacques J. Schorr-Kon and PST staff] Imprint Moscow, Academy of Sciences of the USSR, 1954 [i.e. Jerusalem, Israel Program for Scientific Translations, 1961; available from the Office of Technical Services, U.S. Dept. of Commerce, Washington] Description 444 p. 28 cm. Added t.p. in Russian Translation of Works of the Mathematical Institute, Academy of Sciences of the USSR, v. 42. Original title: Teoriya algerifmov. [QA248.M2943 Dartmouth College library. U.S. Dept. of Commerce, Office of Technical Services, number OTS 60-51085.]
* [[Z. A. Melzak]] (1961, receivedrecebido em 15 Mayde Maio de 1961), ''An informal Arthmetical Approach to Computability and Computation'', Canadian Mathematical Bulletin, vol. 4, no. 3. September 1961 pages 279-293.
* {{cite journal|author=[[Marvin Minsky]]
|title=Recursive Unsolvability of Post's Problem of 'Tag' and Other Topics in Theory of Turing Machines
* [[Marvin Minsky]], ''Computation: Finite and Infinite Machines'', Prentice–Hall, Inc., N.J., 1967. See Chapter 8, Section 8.2 "Unsolvability of the Halting Problem."
* {{cite book|author = [[Christos Papadimitriou]] | year = 1993 | title = Computational Complexity | publisher = Addison Wesley | edition = 1st | isbn = 0-201-53082-1}} Chapter 2: Turing machines, pp. 19–56.
* {{Citation|first=Nicholas|last=Pippenger|authorlink=Nick, Pippenger|first2=MichaelNicholas; J.|last2=Fischer|authorlink2=, Michael J. Fischer|title=(1979) ''Relations Among Complexity Measures|journal='', Journal of the Association of Computing Machinery (JACM|year=1979|volume=) '''26|issue=''' (3|pages=): 361–381|, doi=:10.1145/322123.322138}}
* A. [[Schonhage]] (1980), ''Storage Modification Machines'', Society for Industrial and Applied Mathematics, SIAM J. Comput. Vol. 9, No. 3, August 1980.
* [[John C. Shepherdson]] ande [[H. E. Sturgis]] (1961) received December 1961 ''Computability of Recursive Functions'', Journal of the Association of Computing Machinery (JACM) 10:217-255, 1963.
[[Categoria:Teoria da computação]]
| 