Editing Random-access machine (section)

==References==
{{Reflist}}
With a few exceptions, these references are the same as those at [[Register machine]].
** Goldstine, Herman H., and von Neumann, John, "Planning and Coding of the Problems for an Electronic Computing Instrument", Rep. 1947, [[Institute for Advanced Study]], Princeton. Reprinted on pp.&nbsp;92–119 in Bell, C. Gordon and Newell, Allen (1971), ''Computer Structures: Readings and Examples'', McGraw-Hill Book Company, New York. {{ISBN|0-07-004357-4}}}.
* [[George Boolos]], [[John P. Burgess]], [[Richard Jeffrey]] (2002), ''Computability and Logic: Fourth Edition'', Cambridge University Press, Cambridge, England. The original Boolos-Jeffrey text has been extensively revised by Burgess: more advanced than an introductory textbook. "Abacus machine" model is extensively developed in Chapter 5 ''Abacus Computability''; it is one of three models extensively treated and compared{{spaced ndash}}the Turing machine (still in Boolos' original 4-tuple form) and recursion the other two.
* [[Arthur Burks]], [[Herman Goldstine]], [[John von Neumann]] (1946), ''Preliminary discussion of the logical design of an electronic computing instrument'', reprinted pp.&nbsp;92ff in [[Gordon Bell]] and [[Allen Newell]] (1971), ''Computer Structures: Readings and Examples'', mcGraw-Hill Book Company, New York. {{ISBN|0-07-004357-4}}  .
* [[Stephen Cook|Stephen A. Cook]] and Robert A. Reckhow (1973), ''Time-bounded random access machines'', Journal of Computer Systems Science 7(4):354-375.
* [[Martin Davis (mathematician)|Martin Davis]] (1958), ''Computability & Unsolvability'', McGraw-Hill Book Company, Inc. New York.
* [[Calvin Elgot]] and [[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.&nbsp;365–399.
* [[J. Hartmanis]] (1971), "Computational Complexity of Random Access Stored Program Machines," Mathematical Systems Theory 5, 3 (1971) pp.&nbsp;232–245.
* [[John Hopcroft]], [[Jeffrey Ullman]] (1979). ''Introduction to Automata Theory, Languages and Computation'', 1st ed., Reading Mass: Addison-Wesley. {{ISBN|0-201-02988-X}}.  A difficult book centered around the issues of machine-interpretation of "languages", NP-Completeness, etc.
* [[Stephen Kleene]] (1952), ''Introduction to Metamathematics'', North-Holland Publishing Company, Amsterdam, Netherlands. {{ISBN|0-7204-2103-9}}.
* [[Donald Knuth]] (1968), ''The Art of Computer Programming'', Second Edition 1973, Addison-Wesley, Reading, Massachusetts. Cf pages 462-463 where he defines "a new kind of abstract machine or 'automaton' which deals with linked structures."
* [[Joachim Lambek]] (1961, received 15 June 1961), ''How to Program an Infinite Abacus'', Mathematical Bulletin, vol. 4, no. 3. September 1961 pages 295-302. In his Appendix II, Lambek proposes a "formal definition of 'program'. He references Melzak (1961) and Kleene (1952) ''Introduction to Metamathematics''.
* [[Z. A. Melzak]] (1961, received 15 May 1961), ''An informal Arithmetical Approach to Computability and Computation'', [[Canadian Mathematical Bulletin]], vol. 4, no. 3. September 1961 pages 279-293. Melzak offers no references but acknowledges "the benefit of conversations with Drs. R. Hamming, D. McIlroy and V. Vyssots of the Bell telephone Laborators and with Dr. H. Wang of Oxford University."
* {{cite journal|author=[[Marvin Minsky]]
 |title=Recursive Unsolvability of Post's Problem of 'Tag' and Other Topics in Theory of Turing Machines
 |journal=Annals of Mathematics
 |date=1961
 |volume=74
 |pages=437–455
 |doi=10.2307/1970290|jstor=1970290|issue=3|publisher=The Annals of Mathematics, Vol. 74, No. 3
}}
* {{cite book |author= Marvin Minsky |title = Computation: Finite and Infinite Machines |url= https://archive.org/details/computationfinit0000mins |url-access= registration | edition = 1st | publisher = Prentice-Hall, Inc.| location = Englewood Cliffs, N. J. | year = 1967}} In particular see chapter 11: ''Models Similar to Digital Computers'' and chapter 14: ''Very Simple Bases for Computability''. In the former chapter he defines "Program machines" and in the later chapter he discusses "Universal Program machines with Two Registers" and "...with one register", etc.
* [[John C. Shepherdson]] and [[H. E. Sturgis]] (1961) received December 1961 ''Computability of Recursive Functions'', Journal of the Association for Computing Machinery (JACM) 10:217-255, 1963. An extremely valuable reference paper. In their Appendix A the authors cite 4 others with reference to "Minimality of Instructions Used in 4.1: Comparison with Similar Systems".
:*Kaphengst, Heinz, ''Eine Abstrakte programmgesteuerte Rechenmaschine''', Zeitschrift fur mathematische Logik und Grundlagen der Mathematik:''5'' (1959), 366-379.
:*[[Andrey Ershov|Ershov, A. P.]] ''On operator algorithms'', (Russian) Dok. Akad. Nauk 122 (1958), 967-970. English translation, Automat. Express 1 (1959), 20-23.
:*[[Rózsa Péter|Péter, Rózsa]] ''Graphschemata und rekursive Funktionen'', Dialectica 12 (1958), 373.
:*Hermes, Hans ''Die Universalität programmgesteuerter Rechenmaschinen.'' Math.-Phys. Semsterberichte (Göttingen) 4 (1954), 42-53.
* [[Arnold Schönhage]] (1980), ''Storage Modification Machines'', Society for Industrial and Applied Mathematics, SIAM J. Comput. Vol. 9, No. 3, August 1980. Wherein Schōnhage shows the equivalence of his SMM with the "successor RAM" (Random Access Machine), etc. resp. ''Storage Modification Machines'', in ''Theoretical Computer Science'' (1979), pp.&nbsp;36–37
* [[Peter van Emde Boas]], "Machine Models and Simulations" pp.&nbsp;3–66, in: [[Jan van Leeuwen]], ed. ''Handbook of Theoretical Computer Science. Volume A: Algorithms and Complexity'', The MIT PRESS/Elsevier, 1990. {{ISBN|0-444-88071-2}} (volume A). QA 76.H279 1990. van Emde Boas's treatment of SMMs appears on pp.&nbsp;32–35. This treatment clarifies Schōnhage 1980{{spaced ndash}}it closely follows but expands slightly the Schōnhage treatment. Both references may be needed for effective understanding.
* [[Hao Wang (academic)|Hao Wang]] (1957), ''A Variant to Turing's Theory of Computing Machines'', JACM (Journal of the Association for Computing Machinery) 4; 63-92. Presented at the meeting of the Association, June 23–25, 1954.

[[Category:Register machines]]