In mathematical logic and theoretical computer science, a register machine is a generic class of abstract machines used in a manner similar to a Turing machine. All models of register machines are Turing equivalent.


The register machine gets its name from its use of one or more "registers". In contrast to the tape and head used by a Turing machine, the model uses multiple, uniquely addressed registers, each of which holds a single non-negative integer.

There are at least four sub-classes found in literature, here listed from most primitive to the most like a computer:

Any properly defined register machine model is Turing equivalent. Computational speed is very dependent on the model specifics.

In practical computer science, a related concept known as a virtual machine is occasionally employed to reduce reliance on underlying machine architectures. These virtual machines are also utilised in educational settings. In textbooks, the term "register machine" is sometimes used interchangeably to describe a virtual machine.[1]

Formal definition

A register machine consists of:

  1. An unbounded number of labelled, discrete, unbounded registers unbounded in extent (capacity): a finite (or infinite in some models) set of registers each considered to be of infinite extent and each of which holds a single non-negative integer (0, 1, 2, ...).[nb 1] The registers may do their own arithmetic, or there may be one or more special registers that do the arithmetic e.g. an "accumulator" and/or "address register". See also Random-access machine.
  2. Tally counters or marks:[nb 2] discrete, indistinguishable objects or marks of only one sort suitable for the model. In the most-reduced counter machine model, per each arithmetic operation only one object/mark is either added to or removed from its location/tape. In some counter machine models (e.g. Melzak,[2] Minsky[3]) and most RAM and RASP models more than one object/mark can be added or removed in one operation with "addition" and usually "subtraction"; sometimes with "multiplication" and/or "division". Some models have control operations such as "copy" (variously: "move", "load", "store") that move "clumps" of objects/marks from register to register in one action.
  3. A limited set of instructions: the instructions tend to divide into two classes: arithmetic and control. The instructions are drawn from the two classes to form "instruction sets", such that an instruction set must allow the model to be Turing equivalent (it must be able to compute any partial recursive function).
    1. Arithmetic: Arithmetic instructions may operate on all registers or on a specific register, such as an accumulator. Typically, they are selected from the following sets, though exceptions exist: Counter machine: { Increment (r), Decrement (r), Clear-to-zero (r) } Reduced RAM, RASP: { Increment (r), Decrement (r), Clear-to-zero (r), Load-immediate-constant k, Add (r1,r2), Proper-Subtract (r1,r2), Increment accumulator, Decrement accumulator, Clear accumulator, Add the contents of register r to the accumulator, Proper-Subtract the contents of register r from the accumulator } Augmented RAM, RASP: Includes all of the reduced instructions as well as: { Multiply, Divide, various Boolean bit-wise operations (left-shift, bit test, etc.) }
    2. Control: Counter machine models: Optionally include { Copy (r1,r2) }. RAM and RASP models: Most include { Copy (r1,r2) }, or { Load Accumulator from r, Store accumulator into r, Load Accumulator with an immediate constant }. All models: Include at least one conditional "jump" (branch, goto) following the test of a register, such as { Jump-if-zero, Jump-if-not-zero (i.e., Jump-if-positive), Jump-if-equal, Jump-if-not-equal }. All models optionally include: { unconditional program jump (goto) }.
    3. Register-addressing method:
      • Counter machine: no indirect addressing, immediate operands possible in highly atomised models
      • RAM and RASP: indirect addressing available, immediate operands typical
    4. Input-output: optional in all models
  4. State register: A special Instruction Register (IR), distinct from the registers mentioned earlier, stores the current instruction to be executed along with its address in the instruction table. This register, along with its associated table, is located within the finite state machine. The IR is inaccessible in all models. In the case of RAM and RASP, for determining the "address" of a register, the model can choose either (i) the address specified by the table and temporarily stored in the IR for direct addressing or (ii) the contents of the register specified by the instruction in the IR for indirect addressing. It's important to note that the IR is not the "program counter" (PC) of the RASP (or conventional computer). The PC is merely another register akin to an accumulator, but specifically reserved for holding the number of the RASP's current register-based instruction. Thus, a RASP possesses two "instruction/program" registers: (i) the IR (finite state machine's Instruction Register), and (ii) a PC (Program Counter) for the program stored in the registers. Additionally, aside from the PC, a RASP may also dedicate another register to the "Program-Instruction Register" (referred to by various names such as "PIR," "IR," "PR," etc.).
  5. List of labelled instructions, usually in sequential order: A finite list of instructions . In the case of the counter machine, random-access machine (RAM) and pointer machine the instruction store is in the "TABLE" of the finite state machine; thus these models are examples of the Harvard architecture. In the case of the RASP, the program store is in the registers; thus this is an example of the Von Neumann architecture. See also Random-access machine and Random-access stored-program machine.
    Usually, like computer programs, the instructions are listed in sequential order; unless a jump is successful the default sequence continues in numerical order. An exception to this is the abacus[4][3] counter machine models—every instruction has at least one "next" instruction identifier "z", and the conditional branch has two.
    • Observe also that the abacus model combines two instructions, JZ then DEC: e.g. { INC ( r, z ), JZDEC ( r, ztrue, zfalse ) }.
      See McCarthy Formalism for more about the conditional expression "IF r=0 THEN ztrue ELSE zfalse"[5]

Historical development of the register machine model

Two trends appeared in the early 1950s—the first to characterize the computer as a Turing machine, the second to define computer-like models—models with sequential instruction sequences and conditional jumps—with the power of a Turing machine, i.e. a so-called Turing equivalence. Need for this work was carried out in the context of two "hard" problems: the unsolvable word problem posed by Emil Post[6]—his problem of "tag"—and the very "hard" problem of Hilbert's problems—the 10th question around Diophantine equations. Researchers were questing for Turing-equivalent models that were less "logical" in nature and more "arithmetic"[2]: 281 [7]: 218 

The first trend toward characterising computers has originated[nb 3] with Hans Hermes (1954),[8] Rózsa Péter (1958),[9] and Heinz Kaphengst [de] (1959),[10] the second trend with Hao Wang (1954,[11] 1957[12]) and, as noted above, furthered along by Zdzislaw Alexander Melzak [d] (1961),[2] Joachim Lambek (1961)[4] and Marvin Minsky (1961,[3] 1967[13]).

The last five names are listed explicitly in that order by Yuri Matiyasevich. He follows up with:

"Register machines [some authors use "register machine" synonymous with "counter-machine"] are particularly suitable for constructing Diophantine equations. Like Turing machines, they have very primitive instructions and, in addition, they deal with numbers".[14]

Lambek, Melzak, Minsky, Shepherdson and Sturgis independently discovered the same idea at the same time. See note on precedence below.

The history begins with Wang's model.

Wang's (1954, 1957) model: Post–Turing machine

Wang's work followed from Emil Post's (1936)[6] paper and led Wang to his definition of his Wang B-machine—a two-symbol Post–Turing machine computation model with only four atomic instructions:

{ LEFT, RIGHT, PRINT, JUMP_if_marked_to_instruction_z }

To these four both Wang (1954,[11] 1957[12]) and then C. Y. Lee (1961)[15] added another instruction from the Post set { ERASE }, and then a Post's unconditional jump { JUMP_to_ instruction_z } (or to make things easier, the conditional jump JUMP_IF_blank_to_instruction_z, or both. Lee named this a "W-machine" model:

{ LEFT, RIGHT, PRINT, ERASE, JUMP_if_marked, [maybe JUMP or JUMP_IF_blank] }

Wang expressed hope that his model would be "a rapprochement": 63  between the theory of Turing machines and the practical world of the computer.

Wang's work was highly influential. We find him referenced by Minsky (1961)[3] and (1967),[13] Melzak (1961),[2] Shepherdson and Sturgis (1963).[7] Indeed, Shepherdson and Sturgis (1963) remark that:

"...we have tried to carry a step further the 'rapprochement' between the practical and theoretical aspects of computation suggested by Wang"[7]: 218 

Martin Davis eventually evolved this model into the (2-symbol) Post–Turing machine.

Difficulties with the Wang/Post–Turing model:

Except there was a problem: the Wang model (the six instructions of the 7-instruction Post–Turing machine) was still a single-tape Turing-like device, however nice its sequential program instruction-flow might be. Both Melzak (1961)[2] and Shepherdson and Sturgis (1963)[7] observed this (in the context of certain proofs and investigations):

"...a Turing machine has a certain opacity... a Turing machine is slow in (hypothetical) operation and, usually, complicated. This makes it rather hard to design it, and even harder to investigate such matters as time or storage optimisation or a comparison between the efficiency of two algorithms.[2]: 281 
"...although not difficult ... proofs are complicated and tedious to follow for two reasons: (1) A Turing machine has only a head so that one is obliged to break down the computation into very small steps of operations on a single digit. (2) It has only one tape so that one has to go to some trouble to find the number one wishes to work on and keep it separate from other numbers"[7]: 218 

Indeed, as examples in Turing machine examples, Post–Turing machine and partial functions show, the work can be "complicated".

Minsky, Melzak–Lambek and Shepherdson–Sturgis models "cut the tape" into many

This section's tone or style may not reflect the encyclopedic tone used on Wikipedia. See Wikipedia's guide to writing better articles for suggestions. (January 2024) (Learn how and when to remove this message)

Initial thought leads to 'cutting the tape' so each is infinitely long (to accommodate any size integer) but left-ended, and call these three tapes "Post–Turing (i.e. Wang-like) tapes". The individual heads will move left (for decrement) and right (for increment). In one sense the heads indicate "the tops of the stack" of concatenated marks. Or in Minsky (1961)[3] and Hopcroft and Ullman (1979)[16]: 171ff  the tape is always blank except for a mark at the left end—at no time does a head ever print or erase.

Care must be taken to write the instructions so that a test-for-zero and jump occurs before decrementing, otherwise the machine will "fall off the end" or "bump against the end"—creating an instance of a partial function.

Minsky (1961)[3] and Shepherdson–Sturgis (1963)[7] prove that only a few tapes—as few as one—still allow the machine to be Turing equivalent if the data on the tape is represented as a Gödel number (or some other uniquely encodable Encodable-decodable number); this number will evolve as the computation proceeds. In the one tape version with Gödel number encoding the counter machine must be able to (i) multiply the Gödel number by a constant (numbers "2" or "3"), and (ii) divide by a constant (numbers "2" or "3") and jump if the remainder is zero. Minsky (1967)[13] shows that the need for this bizarre instruction set can be relaxed to { INC (r), JZDEC (r, z) } and the convenience instructions { CLR (r), J (r) } if two tapes are available. A simple Gödelization is still required, however. A similar result appears in Elgot–Robinson (1964)[17] with respect to their RASP model.

Melzak's (1961) model is different: clumps of pebbles go into and out of holes

Melzak's (1961)[2] model is significantly different. He took his own model, flipped the tapes vertically, called them "holes in the ground" to be filled with "pebble counters". Unlike Minsky's "increment" and "decrement", Melzak allowed for proper subtraction of any count of pebbles and "adds" of any count of pebbles.

He defines indirect addressing for his model[2]: 288  and provides two examples of its use;[2]: 89  his "proof"[2]: 290–292  that his model is Turing equivalent is so sketchy that the reader cannot tell whether or not he intended the indirect addressing to be a requirement for the proof.

Legacy of Melzak's model is Lambek's simplification and the reappearance of his mnemonic conventions in Cook and Reckhow 1973.[18]

Lambek (1961) atomizes Melzak's model into the Minsky (1961) model: INC and DEC-with-test

Lambek (1961)[4] took Melzak's ternary model and atomized it down to the two unary instructions—X+, X− if possible else jump—exactly the same two that Minsky (1961)[3] had come up with.

However, like the Minsky (1961)[3] model, the Lambek model does execute its instructions in a default-sequential manner—both X+ and X− carry the identifier of the next instruction, and X− also carries the jump-to instruction if the zero-test is successful.

Elgot–Robinson (1964) and the problem of the RASP without indirect addressing

A RASP or random-access stored-program machine begins as a counter machine with its "program of instruction" placed in its "registers". Analogous to, but independent of, the finite state machine's "Instruction Register", at least one of the registers (nicknamed the "program counter" (PC)) and one or more "temporary" registers maintain a record of, and operate on, the current instruction's number. The finite state machine's TABLE of instructions is responsible for (i) fetching the current program instruction from the proper register, (ii) parsing the program instruction, (iii) fetching operands specified by the program instruction, and (iv) executing the program instruction.

Except there is a problem: If based on the counter machine chassis this computer-like, von Neumann machine will not be Turing equivalent. It cannot compute everything that is computable. Intrinsically the model is bounded by the size of its (very-) finite state machine's instructions. The counter machine based RASP can compute any primitive recursive function (e.g. multiplication) but not all mu recursive functions (e.g. the Ackermann function).

Elgot–Robinson investigate the possibility of allowing their RASP model to "self modify" its program instructions.[17] The idea was an old one, proposed by Burks–Goldstine–von Neumann (1946–1947),[19] and sometimes called "the computed goto." Melzak (1961)[2] specifically mentions the "computed goto" by name but instead provides his model with indirect addressing.

Computed goto: A RASP program of instructions that modifies the "goto address" in a conditional- or unconditional-jump program instruction.

But this does not solve the problem (unless one resorts to Gödel numbers). What is necessary is a method to fetch the address of a program instruction that lies (far) "beyond/above" the upper bound of the finite state machine instruction register and TABLE.

Example: A counter machine equipped with only four unbounded registers can e.g. multiply any two numbers ( m, n ) together to yield p—and thus be a primitive recursive function—no matter how large the numbers m and n; moreover, less than 20 instructions are required to do this! e.g. { 1: CLR ( p ), 2: JZ ( m, done ), 3 outer_loop: JZ ( n, done ), 4: CPY ( m, temp ), 5: inner_loop: JZ ( m, outer_loop ), 6: DEC ( m ), 7: INC ( p ), 8: J ( inner_loop ), 9: outer_loop: DEC ( n ), 10 J ( outer_loop ), HALT }
However, with only 4 registers, this machine has not nearly big enough to build a RASP that can execute the multiply algorithm as a program. No matter how big we build our finite state machine there will always be a program (including its parameters) which is larger. So by definition the bounded program machine that does not use unbounded encoding tricks such as Gödel numbers cannot be universal.

Minsky (1967)[13] hints at the issue in his investigation of a counter machine (he calls them "program computer models") equipped with the instructions { CLR (r), INC (r), and RPT ("a" times the instructions m to n) }. He doesn't tell us how to fix the problem, but he does observe that:

"... the program computer has to have some way to keep track of how many RPT's remain to be done, and this might exhaust any particular amount of storage allowed in the finite part of the computer. RPT operations require infinite registers of their own, in general, and they must be treated differently from the other kinds of operations we have considered."[13]: 214 

But Elgot and Robinson solve the problem:[17] They augment their P0 RASP with an indexed set of instructions—a somewhat more complicated (but more flexible) form of indirect addressing. Their P'0 model addresses the registers by adding the contents of the "base" register (specified in the instruction) to the "index" specified explicitly in the instruction (or vice versa, swapping "base" and "index"). Thus the indexing P'0 instructions have one more parameter than the non-indexing P0 instructions:

Example: INC ( rbase, index ) ; effective address will be [rbase] + index, where the natural number "index" is derived from the finite-state machine instruction itself.

Hartmanis (1971)

By 1971 Hartmanis has simplified the indexing to indirection for use in his RASP model.[20]

Indirect addressing: A pointer-register supplies the finite state machine with the address of the target register required for the instruction. Said another way: The contents of the pointer-register is the address of the "target" register to be used by the instruction. If the pointer-register is unbounded, the RAM, and a suitable RASP built on its chassis, will be Turing equivalent. The target register can serve either as a source or destination register, as specified by the instruction.

Note that the finite state machine does not have to explicitly specify this target register's address. It just says to the rest of the machine: Get me the contents of the register pointed to by my pointer-register and then do xyz with it. It must specify explicitly by name, via its instruction, this pointer-register (e.g. "N", or "72" or "PC", etc.) but it doesn't have to know what number the pointer-register actually contains (perhaps 279,431).

Cook and Reckhow (1973) describe the RAM

Cook and Reckhow (1973)[18] cite Hartmanis (1971)[20] and simplify his model to what they call a random-access machine (RAM—i.e. a machine with indirection and the Harvard architecture). In a sense we are back to Melzak (1961)[2] but with a much simpler model than Melzak's.


Minsky was working at the MIT Lincoln Laboratory and published his work there; his paper was received for publishing in the Annals of Mathematics on 15 August 1960, but not published until November 1961.[3] While receipt occurred a full year before the work of Melzak[2] and Lambek[4] was received and published (received, respectively, May and 15 June 1961, and published side-by-side September 1961). That (i) both were Canadians and published in the Canadian Mathematical Bulletin, (ii) neither would have had reference to Minsky's work because it was not yet published in a peer-reviewed journal, but (iii) Melzak references Wang, and Lambek references Melzak, leads one to hypothesize that their work occurred simultaneously and independently.

Almost exactly the same thing happened to Shepherdson and Sturgis.[21] Their paper was received in December 1961—just a few months after Melzak and Lambek's work was received. Again, they had little (at most 1 month) or no benefit of reviewing the work of Minsky. They were careful to observe in footnotes that papers by Ershov,[22] Kaphengst[10] and Péter[9] had "recently appeared"[21]: 219  These were published much earlier but appeared in the German language in German journals so issues of accessibility present themselves.

The final paper of Shepherdson and Sturgis did not appear in a peer-reviewed journal until 1963.[7] And as they note in their Appendix A, the 'systems' of Kaphengst (1959),[10] Ershov (1958),[22] Péter (1958)[9] are all so similar to what results were obtained later as to be indistinguishable to a set of the following:

produce 0 i.e. 0 → n
increment a number i.e. n+1 → n
"i.e. of performing the operations which generate the natural numbers"[7]: 246 
copy a number i.e. n → m
to "change the course of a computation", either comparing two numbers or decrementing until 0

Indeed, Shepherson and Sturgis conclude

"The various minimal systems are very similar"[7]: 246 

By order of publishing date the work of Kaphengst (1959),[10] Ershov (1958),[22] Péter (1958) were first.[9]

See also


Background texts: The following bibliography of source papers includes a number of texts to be used as background. The mathematics that led to the flurry of papers about abstract machines in the 1950s and 1960s can be found in van Heijenoort (1967)[23]—an assemblage of original papers spanning the 50 years from Frege (1879)[24] to Gödel (1931).[25] Davis (ed.) The Undecidable (1965)[26] carries the torch onward beginning with Gödel (1931)[25] through Gödel's (1964) postscriptum;[27]: 71  the original papers of Alan Turing (1936[28]–1937) and Emil Post (1936)[6] are included in The Undecidable. The mathematics of Church, Rosser and Kleene that appear as reprints of original papers in The Undecidable is carried further in Kleene (1952),[29] a mandatory text for anyone pursuing a deeper understanding of the mathematics behind the machines. Both Kleene (1952)[29] and Davis (1958)[30] are referenced by a number of the papers.

For a good treatment of the counter machine see Minsky (1967) Chapter 11 "Models similar to Digital Computers"—he calls the counter machine a "program computer".[13] A recent overview is found at van Emde Boas (1990).[31] A recent treatment of the Minsky (1961)[3]/Lambek (1961)[4] model can be found Boolos–Burgess–Jeffrey (2002);[32] they reincarnate Lambek's "abacus model" to demonstrate equivalence of Turing machines and partial recursive functions, and they provide a graduate-level introduction to both abstract machine models (counter- and Turing-) and the mathematics of recursion theory. Beginning with the first edition Boolos–Burgess (1970)[33] this model appeared with virtually the same treatment.

The papers: The papers begin with Wang (1957)[12] and his dramatic simplification of the Turing machine. Turing (1936),[28] Kleene (1952),[29] Davis (1958)[30] and in particular Post (1936)[6] are cited in Wang (1957);[12] in turn, Wang is referenced by Melzak (1961),[2] Minsky (1961)[3] and Shepherdson–Sturgis (1961–1963)[21][7] as they independently reduce the Turing tapes to "counters". Melzak (1961)[2] provides his pebble-in-holes counter machine model with indirection but doesn't carry the treatment further. The work of Elgot–Robinson (1964)[17] define the RASP—the computer-like random-access stored-program machines—and appear to be the first to investigate the failure of the bounded counter machine to calculate the mu-recursive functions. This failure—except with the draconian use of Gödel numbers in the manner of Minsky (1961)[3]—leads to their definition of "indexed" instructions (i.e. indirect addressing) for their RASP model. Elgot–Robinson (1964)[17] and more so Hartmanis (1971)[20] investigate RASPs with self-modifying programs. Hartmanis (1971)[20] specifies an instruction set with indirection, citing lecture notes of Cook (1970).[34] For use in investigations of computational complexity Cook and his graduate student Reckhow (1973)[18] provide the definition of a RAM (their model and mnemonic convention are similar to Melzak's, but offer him no reference in the paper). The pointer machines are an offshoot of Knuth (1968,[35] 1973) and independently Schönhage (1980).[36]

For the most part the papers contain mathematics beyond the undergraduate level—in particular the primitive recursive functions and mu recursive functions presented elegantly in Kleene (1952)[29] and less in depth, but useful nonetheless, in Boolos–Burgess–Jeffrey (2002).[32]

All texts and papers excepting the four starred have been witnessed. These four are written in German and appear as references in Shepherdson–Sturgis (1963)[7] and Elgot–Robinson (1964);[17] Shepherdson–Sturgis (1963)[7] offer a brief discussion of their results in Shepherdson–Sturgis' Appendix A. The terminology of at least one paper (Kaphengst (1959)[10] seems to hark back to the Burke–Goldstine–von Neumann (1946–1947)[19] analysis of computer architecture.

Author Year Reference Turing machine Counter machine RAM RASP Pointer machine Indirect addressing Self-modifying program
Goldstine & von Neumann 1947[19] Yes Yes
Kleene 1952[29] Yes
Hermes 1954–1955[8] ?
Wang 1957[12] Yes Yes hints hints
Péter 1958[9] ?
Davis 1958[30] Yes Yes
Ershov 1959[22] ?
Kaphengst 1959[10] ? Yes
Melzak 1961[2] Yes Yes hints
Lambek 1961[4] Yes
Minsky 1961[3] Yes
Shepherdson & Sturgis 1963[7] Yes hints
Elgot & Robinson 1964[17] Yes Yes Yes
Davis- Undecidable 1965[26] Yes Yes
van Heijenoort 1967[23] Yes
Minsky 1967[13] Yes hints hints
Knuth 1968,[35] 1973 Yes Yes Yes Yes
Hartmanis 1971[20] Yes Yes
Cook & Reckhow 1973[18] Yes Yes Yes Yes
Schönhage 1980[36] Yes Yes Yes
van Emde Boas 1990[31] Yes Yes Yes Yes Yes Yes
Boolos & Burgess; Boolos, Burgess & Jeffrey 1970[33]–2002[32] Yes Yes Yes


  1. ^ ". . . a denumerable sequence of registers numbered 1, 2, 3, ..., each of which can store any natural number 0, 1, 2, .... Each particular program, however, involves only a finite number of these registers, the others remaining empty (i.e. containing 0) throughout the computation." (Shepherdson and Sturgis 1961: p. 219); (Lambek 1961: p. 295) proposed: "a countably infinite set of locations (holes, wires, etc).
  2. ^ For example, (Lambek 1961: p. 295) proposed the use of pebbles, beads, etc.
  3. ^ See the "Note" in (Shepherdson and Sturgis 1963: p. 219). In their Appendix A the authors follow up with a listing and discussions of Kaphengst's, Ershov's and Péter's instruction sets (cf p. 245ff).


  1. ^ Harold Abelson and Gerald Jay Sussman with Julie Sussman, Structure and Interpretation of Computer Programs, MIT Press, Cambridge, Massachusetts, 2nd edition, 1996
  2. ^ a b c d e f g h i j k l m n o p Melzak, Zdzislaw Alexander [at Wikidata] (September 1961). "An Informal Arithmetical Approach to Computability and Computation". Canadian Mathematical Bulletin. 4 (3): 89, 279–293 [89, 281, 288, 290–292]. doi:10.4153/CMB-1961-031-9. The manuscript was received by the journal on 15 May 1961. Melzak offers no references but acknowledges "the benefit of conversations with Drs. R. Hamming, D. McIlroy and V. Vyssotsky of the Bell Telephone Laboratories and with Dr. H. Wang of Oxford University." [1]
  3. ^ a b c d e f g h i j k l m Minsky, Marvin (1961). "Recursive Unsolvability of Post's Problem of 'Tag' and Other Topics in Theory of Turing Machines". Annals of Mathematics. 74 (3): 437–455 [438, 449]. doi:10.2307/1970290. JSTOR 1970290.
  4. ^ a b c d e f Lambek, Joachim (September 1961). "How to Program an Infinite Abacus". Canadian Mathematical Bulletin. 4 (3): 295–302 [295]. doi:10.4153/CMB-1961-032-6. The manuscript was received by the journal on 15 June 1961. In his Appendix II, Lambek proposes a "formal definition of 'program'. He references Melzak (1961) and Kleene (1952) Introduction to Metamathematics.
  5. ^ McCarthy (1960)
  6. ^ a b c d Emil Post (1936)
  7. ^ a b c d e f g h i j k l m Shepherdson, Sturgis (1963): 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 [218, 219, 245ff, 246], 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".
  8. ^ a b Hans Hermes "Die Universalität programmgesteuerter Rechenmaschinen". Math.-Phys. Semesterberichte (Göttingen) 4 (1954), 42–53.
  9. ^ a b c d e Péter, Rózsa "Graphschemata und rekursive Funktionen", Dialectica 12 (1958), 373.
  10. ^ a b c d e f Kaphengst, Heinz [de], "Eine Abstrakte Programmgesteuerte Rechenmaschine", Zeitschrift fur mathematische Logik und Grundlagen der Mathematik 5 (1959), 366–379. [2]
  11. ^ a b Hao Wang "Variant to Turing's Theory of Computing Machines". Presented at the meeting of the Association, 23–25 June 1954.
  12. ^ a b c d e 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, 23–25 June 1954.
  13. ^ a b c d e f g Minsky, Marvin (1967). Computation: Finite and Infinite Machines (1st ed.). Englewood Cliffs, New Jersey, USA: Prentice-Hall, Inc. p. 214. 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.
  14. ^ Yuri Matiyasevich, Hilbert's Tenth Problem, commentary to Chapter 5 of the book, at
  15. ^ C. Y. Lee (1961)
  16. ^ John Hopcroft, Jeffrey Ullman (1979). Introduction to Automata Theory, Languages and Computation, 1st ed., Reading Mass: Addison-Wesley. ISBN 0-201-02988-X, pp. 171ff. A difficult book centered around the issues of machine-interpretation of "languages", NP-Completeness, etc.
  17. ^ a b c d e f g 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. 365–399.
  18. ^ a b c d Stephen A. Cook and Robert A. Reckhow (1972), Time-bounded random access machines, Journal of Computer Systems Science 7 (1973), 354–375.
  19. ^ a b c Arthur Burks, Herman Goldstine, John von Neumann (1946–1947), "Preliminary discussion of the logical design of an electronic computing instrument", reprinted pp. 92ff in Gordon Bell and Allen Newell (1971), Computer Structures: Readings and Examples, McGraw-Hill Book Company, New York. ISBN 0-07-004357-4.
  20. ^ a b c d e Juris Hartmanis (1971), "Computational Complexity of Random Access Stored Program Machines," Mathematical Systems Theory 5, 3 (1971) pp. 232–245.
  21. ^ a b c Shepherdson, Sturgis (1961), p. 219
  22. ^ a b c d Ershov, Andrey P. "On operator algorithms", (Russian) Dok. Akad. Nauk 122 (1958), 967–970. English translation, Automat. Express 1 (1959), 20–23.
  23. ^ a b van Heijenoort (1967)
  24. ^ Frege (1879)
  25. ^ a b Gödel (1931)
  26. ^ a b Davis (ed.) The Undecidable (1965)
  27. ^ Gödel (1964), postscriptum p. 71.
  28. ^ a b Turing (1936)
  29. ^ a b c d e Stephen Kleene (1952), Introduction to Metamathematics, North-Holland Publishing Company, Amsterdam, Netherlands. ISBN 0-7204-2103-9.
  30. ^ a b c Martin Davis (1958), Computability & Unsolvability, McGraw-Hill Book Company, Inc. New York.
  31. ^ a b Peter van Emde Boas, "Machine Models and Simulations" pp. 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' treatment of SMMs appears on pp. 32–35. This treatment clarifies Schōnhage 1980—it closely follows but expands slightly the Schōnhage treatment. Both references may be needed for effective understanding.
  32. ^ a b c 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—the Turing machine (still in Boolos' original 4-tuple form) and recursion the other two.
  33. ^ a b George Boolos, John P. Burgess (1970)
  34. ^ Cook (1970)
  35. ^ a b 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."
  36. ^ a b 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. 36–37

Further reading