WikiMili The Free Encyclopedia

This article has multiple issues. Please help improve it or discuss these issues on the talk page . (Learn how and when to remove these template messages)
(Learn how and when to remove this template message) |

In computer science, **random-access machine** (RAM) is an abstract machine in the general class of register machines. The RAM is very similar to the counter machine but with the added capability of 'indirect addressing' of its registers. Like the counter machine the RAM has its instructions in the finite-state portion of the machine (the so-called Harvard architecture).

**Computer science** is the study of processes that interact with data and that can be represented as data in the form of programs. It enables the use of algorithms to manipulate, store, and communicate digital information. A computer scientist studies the theory of computation and the practice of designing software systems.

An **abstract machine**, also called an **abstract computer**, is a theoretical model of a computer hardware or software system used in automata theory. Abstraction of computing processes is used in both the computer science and computer engineering disciplines and usually assumes a discrete time paradigm.

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 the models are Turing equivalent.

- Introduction to the model
- Formal definition
- Refresher: The counter-machine model
- Creating "convenience instructions" from the base sets
- The "indirect" operation
- Example of indirect addressing
- Why the need for an indirect operation: Two major problems with the counter-machine model
- Bounded indirection and the primitive recursive functions
- Unbounded indirection and the partial recursive functions
- The indirect COPY instruction
- The notion of "accumulator A"
- The notion of indirect address register "N"
- Turing equivalence of the RAM with indirection
- Example: Bounded indirection yields a machine that is not Turing equivalent
- Examples of models
- Register-to-register ("read-modify-write") model of Cook and Reckhow (1973)
- Schönhage's RAM0 and RAM1 (1980)
- Footnotes
- Finite vs unbounded
- See also
- External links
- References

The RAM's equivalent of the universal Turing machine –with its program in the registers as well as its data –is called the random-access stored-program machine or RASP. It is an example of the so-called von Neumann architecture and is closest to the common notion of computer.

In computer science, a **universal Turing machine** (**UTM**) is a Turing machine that can simulate an arbitrary Turing machine on arbitrary input. The universal machine essentially achieves this by reading both the description of the machine to be simulated as well as the input thereof from its own tape. Alan Turing introduced the idea of such a machine in 1936–1937. This principle is considered to be the origin of the idea of a stored-program computer used by John von Neumann in 1946 for the "Electronic Computing Instrument" that now bears von Neumann's name: the von Neumann architecture.

A **computer program** is a collection of instructions that performs a specific task when executed by a computer. Most computer devices require programs to function properly.

In theoretical computer science the **random-access stored-program** (RASP) machine model is an abstract machine used for the purposes of algorithm development and algorithm complexity theory.

Together with the Turing machine and counter-machine models, the RAM and RASP models are used for computational complexity analysis. Van Emde Boas (1990) calls these three plus the pointer machine "sequential machine" models, to distinguish them from "parallel random-access machine" models.

A **Turing machine** is a mathematical model of computation that defines an abstract machine, which manipulates symbols on a strip of tape according to a table of rules. Despite the model's simplicity, given any computer algorithm, a Turing machine capable of simulating that algorithm's logic can be constructed.

*This page supplements counter machine.*

In theoretical computer science a **pointer machine** is an "atomistic" *abstract computational machine* model akin to the random-access machine.

The concept of a random-access machine (RAM) starts with the simplest model of all, the so-called counter machine model. Two additions move it away from the counter machine, however. The first enhances the machine with the convenience of indirect addressing; the second moves the model toward the more conventional accumulator-based computer with the addition of one or more auxiliary (dedicated) registers, the most common of which is called "the accumulator".

A **counter machine** is an abstract machine used in formal logic and theoretical computer science to model computation. It is the most primitive of the four types of register machines. A counter machine comprises a set of one or more unbounded *registers*, each of which can hold a single non-negative integer, and a list of arithmetic and control instructions for the machine to follow. The counter machine is typically used in the process of designing parallel algorithms in relation to the mutual exclusion principle. When used in this manner, the counter machine is used to model the discrete time-steps of a computational system in relation to memory accesses. By modeling computations in relation to the memory accesses for each respective computational step, parallel algorithms may be designed in such a matter to avoid interlocking, the simultaneous writing operation by two threads to the same memory address.

A *random-access machine* (RAM) is an abstract computational-machine model identical to a multiple-register counter machine with the addition of indirect addressing. At the discretion of an instruction from its finite state machine's TABLE, the machine derives a "target" register's address either (i) directly from the instruction itself, or (ii) indirectly from the *contents* (e.g. number, label) of the "pointer" register specified in the instruction.

By definition: A *register* is a location with both an *address* (a unique, distinguishable designation/locator equivalent to a natural number) and a *content* –a single natural number. For precision we will use the quasi-formal symbolism from Boolos-Burgess-Jeffrey (2002) to specify a register, its contents, and an operation on a register:

- [r] means "the contents of register with address r". The label "r" here is a "variable" that can be filled with a natural number or a letter (e.g. "A") or a name.
- → means "copy/deposit into", or "replaces", but without destruction of the source

- Example: [3] +1 → 3; means "The contents of source register with address "3", plus 1, is put into destination register with address "3" (here source and destination are the same place). If [3]=37, that is, the contents of register 3 is the number "37", then 37+1 = 38 will be put into register 3.

- Example: [3] → 5; means "The contents of source register with address "3" is put into destination register with address "5". If [3]=38, that is, the contents of register 3 is the number 38, then this number will be put into register 5. The contents of register 3 are not disturbed by this operation, so [3] continues to be 38, now the same as [5].

Definition: A *direct* instruction is one that specifies *in the instruction itself* the address of the source or destination register whose contents will be the subject of the instruction. Definition: An *indirect instruction* is one that specifies a "pointer register", the contents of which is the address of a "target" register. The target register can be either a source or a destination (the various COPY instructions provide examples of this). A register can address itself indirectly.

*For want of a standard/convention this article will specify "direct/indirect", abbreviated as "d/i", as a parameter (or parameters) in the instruction:**Example: COPY (***d**, A,**i**, N ) means directly**d**get the source register's address (register "A") from the instruction itself but indirectly**i**get the destination address from pointer-register N. Suppose [N]=3, then register 3 is the destination and the instruction will do the following: [A] → 3.

Definition: The contents of *source register* is used by the instruction. The source register's address can be specified either (i) directly by the instruction, or (ii) indirectly by the pointer register specified by the instruction.

Definition: The contents of the *pointer register* is the *address* of the "target" register.

Definition: The contents of the *pointer register* points to the *target register* –the "target" may be either a source or a destination register.

Definition: The *destination register* is where the instruction deposits its result. The source register's address can be specified either (i) directly by the instruction, or (ii) indirectly by the pointer register specified by the instruction. The source and destination registers can be one

*Melzak (1961) provides an easy visualization of a counter machine: its "registers" are holes in the ground, and these holes hold pebbles. Per an instruction, into and out of these holes "the computer" (person or machine) adds (INCrements) or removes (DECrements) a single pebble. As needed, additional pebbles come from, and excess pebbles go back into, an infinite supply; if the hole is too small to accommodate the pebbles the "computer" digs the hole bigger.*

*Minsky (1961) and Hopcroft-Ullman 1979 (p. 171) offer the visualization of a multi-tape Turing machine with as many left-ended tapes as "registers". Each tape's length is unbounded to the right, and every square is blank except for the left end, which is marked. The*distance*of a tape's "head" from its left end, measured in numbers of tape-squares, represents the natural number in "the register". To DECrement the count of squares the tape head moves left; INCrement it moves right. There is no need to print or erase marks on the tape; the only conditional instructions are to check to see if the head is at the left end, by testing a left-end mark with a "Jump-if-marked instruction".*

*The following instruction "mnemonics" e.g. "CLR (r)" are arbitrary; no standard exists.*

The register machine has, for a memory external to its finite-state machine –an unbounded (cf: footnote|countable and unbounded) collection of discrete and uniquely labelled locations with *unbounded* capacity, called "registers". These registers hold only natural numbers (zero and the positive integers). Per a list of sequential instructions in the finite state machine's TABLE, a few (e.g. 2) types of primitive operations operate on the contents of these "registers". Finally, a *conditional-expression* in the form of an *IF-THEN-ELSE* is available to test the contents of one or two registers and "branch/jump" the finite state machine out of the default instruction-sequence.

**Base model 1**: The model closest to Minsky's (1961) visualization and to Lambek (1961):

- { INCrement contents of register r, DECrement contents of register r,
*IF*contents of register r is Zero*THEN*Jump to instruction I_{z}*ELSE*continue to next instruction }:

Instruction | Mnemonic | Action on register(s) "r" | Action on finite state machine's Instruction Register, IR |
---|---|---|---|

INCrement | INC ( r ) | [r] + 1 → r | [IR] + 1 → IR |

DECrement | DEC ( r ) | [r] - 1 → r | [IR] + 1 → IR |

Jump if Zero | JZ ( r, z ) | none | IF [r] = 0 THEN z → IR ELSE [IR] + 1 → IR |

Halt | H | none | [IR] → IR |

**Base model 2**: The "successor" model (named after the successor function of the Peano axioms):

- { INCrement the contents of register r, CLeaR the contents of register r,
*IF*contents of register r_{j}Equals the contents of register r_{k}*THEN*Jump to instruction I_{z}*ELSE*goto to next instruction }

Instruction | Mnemonic | Action on register(s) "r" | Action on finite state machine's Instruction Register, IR |
---|---|---|---|

CLeaR | CLR ( r ) | 0 → r | [IR] + 1 → IR |

INCrement | INC ( r ) | [r] + 1 → r | [IR] + 1 → IR |

Jump if Equal | JE (r1, r2, z) | none | IF [r1] = [r2] THEN z → IR ELSE [IR] + 1 → IR |

Halt | H | none | [IR] → IR |

**Base model 3**: Used by Elgot-Robinson (1964) in their investigation of bounded and unbounded RASPs –the "successor" model with COPY in the place of CLEAR:

- { INCrement the contents of register r, COPY the contents of register r
_{j}to register r_{k},*IF*contents of register r_{j}Equals the contents of register r_{k}*then*Jump to instruction I_{z}*ELSE*goto to next instruction }

Instruction | Mnemonic | Action on register(s) "r" | Action on finite state machine's Instruction Register, IR |
---|---|---|---|

COPY | COPY (r1, r2) | [r1] → r2 | [IR] + 1 → IR |

INCrement | INC ( r ) | [r] + 1 → r | [IR] + 1 → IR |

Jump if Equal | JE (r1, r2, z) | none | IF [r1] = [r2] THEN z → IR ELSE [IR] + 1 → IR |

Halt | H | none | [IR] → IR |

The three base sets 1, 2, or 3 above are equivalent in the sense that one can create the instructions of one set using the instructions of another set (an interesting exercise: a hint from Minsky (1967) –declare a reserved register e.g. call it "0" (or Z for "zero" or E for "erase") to contain the number 0). The choice of model will depend on which an author finds easiest to use in a demonstration, or a proof, etc.

Moreover, from base sets 1, 2, or 3 we can create *any* of the primitive recursive functions ( cf Minsky (1967), Boolos-Burgess-Jeffrey (2002) ). (How to cast the net wider to capture the *total* and *partial* mu recursive functions will be discussed in context of indirect addressing). However, building the primitive recursive functions is difficult because the instruction sets are so ... primitive (tiny). One solution is to expand a particular set with "convenience instructions" from another set:

*These will not be subroutines in the conventional sense but rather*blocks*of instructions created from the base set and given a mnemonic. In a formal sense, to use these blocks we need to either (i) "expand" them into their base-instruction equivalents –they will require the use of temporary or "auxiliary" registers so the model must take this into account, or (ii) design our machines/models with the instructions 'built in'.*- Example: Base set 1. To create CLR (r) use the block of instructions to count down register r to zero. Observe the use of the hint mentioned above:
- CLR (r) =
_{equiv} *loop*: JZ (r,*exit*)

- DEC (r)
- JZ (0,
*loop*)

*exit*: etc.

- CLR (r) =

Again, all of this is for convenience only; none of this increases the model's intrinsic power.

For example: the most expanded set would include each unique instruction from the three sets, plus unconditional jump J (z) i.e.:

- { CLR (r), DEC (r), INC (r), CPY ( r
_{s}, r_{d}), JZ (r, z), JE ( r_{j}, r_{k}, z ), J(z) }

Most authors pick one or the other of the conditional jumps, e.g. Shepherdson-Sturgis (1963) use the above set minus JE (to be perfectly accurate they use JNZ –Jump if *Not* Zero in place of JZ; yet another possible convenience instruction).

In our daily lives the notion of an "indirect operation" is not unusual.

- Example: A treasure hunt.
- At location "Tom_&_Becky's_cave_in_pirate_chest" will be where we can find a map directing us to "the treasure":
- (1) We go to location "Tom_&_Becky's_cave..." and dig around until we find a wooden box
- (2) Inside the box is a map to the location of the treasure: "under_Thatcher's_front_porch"
- (3) We go to location "under_Thatcher's_front_porch", jackhammer away the concrete, and discover "the treasure": a sack of rusty door-knobs.

Indirection specifies a location identified as the pirate chest in "Tom_&_Becky's_cave..." that acts as a *pointer* to any other location (including itself): its contents (the treasure map) provides the "address" of the *target* location "under_Thatcher's_front_porch" where the real action is occurring.

In the following one must remember that these models are abstract models with two fundamental differences from anything physically real: unbounded numbers of registers each with unbounded capacities. The problem appears most dramatically when one tries to use a counter-machine model to build a RASP that is Turing equivalent and thus compute any partial mu recursive function:

*Melzak (1961) added indirection to his "hole-and-pebble" model so that his model could modify itself with a "computed goto" and provides two examples of its use ("Decimal representation in the scale of d" and "Sorting by magnitude", whether these are used in his proof that the model is Turing equivalent is unclear since "the program itself is left to the reader as an exercise" (p. 292)). Minsky (1961, 1967) was able to demonstrate that, with suitable (but difficult-to-use) Gödel number encoding, the register model did not need indirection to be Turing equivalent; but it did need at least one unbounded register. As noted below, Minsky (1967) hints at the problem for a RASP but doesn't offer a solution. Elgot and Robinson (1964) proved that their RASP model P*_{0}–it has no indirection capability –cannot compute all "recursive sequential functions" (ones that have parameters of arbitrary length) if it does not have the capability of modifying its own instructions, but it can via Gödel numbers if it does (p. 395-397; in particular figure 2 and footnote p. 395). On the other hand their RASP model P'_{0}equipped with an "index register" (indirect addressing) can compute all the "partial recursive sequential functions" (the mu recursive functions) (p. 397-398).

*Cook and Reckhow (1973) say it most succinctly:**The indirect instructions are necessary in order for a fixed program to access an unbounded number of registers as the inputs vary." (p. 73)*

**Unbounded**: The so-called*capacities*of registers versus bounded capacities of state-machine instructions*finite*state part of the machine is supposed to be –by the normal definition of algorithm –*very*finite both in the number of "states" (instructions) and the instructions' sizes (their capacity to hold symbols/signs). So how does a state machine move an arbitrarily large constant directly into a register, e.g. MOVE (k, r) (Move constant k to register r)? If huge constants are necessary they must either start out in the registers themselves or be created by the state machine using a finite number of instructions e.g. multiply and add subroutines using INC and DEC (but not a quasi-infinite number of these!).

*Sometimes the constant k will be created by use of CLR ( r ) followed by INC ( r ) repeated k times –e.g. to put the constant k=3 into register r, i.e. 3 → r, so at the end of the instruction [r]=3: CLR (r), INC (r), INC (r), INC (r). This trick is mentioned by Kleene (1952) p. 223. The problem arises when the number to be created exhausts the number of instructions available to the*finite*state machine; there is always a bigger constant than the number of instructions available to the*finite*state machine.*

**Unbounded**: This is more severe than the first problem. In particular, this problem arises when we attempt to build a so-called RASP, a "universal machine" (see more at Universal Turing machine) that uses its finite-state machine to interpret a "program of instructions" located in its registers –i.e. we are building what is nowadays called a computer with the von Neumann architecture.*numbers*of registers versus bounded state-machine instructions

*Observe that the counter machine's finite state machine must call out a register**explicitly*(directly) by its name/number: INC (65,356) calls out register number "65,365"*explicitly*. If the number of registers exceeds the capability of the*finite*state machine to address them, then registers outside the bounds will be unreachable. For example, if the finite state machine can only reach 65,536 = 2^{16}registers then how can it reach the 65,537th?

*So how do we address a register beyond the bounds of the finite state machine? One approach would be to modify the program-instructions (the ones stored in the registers) so that they contain more than one command. But this too can be exhausted unless an instruction is of (potentially) unbounded size. So why not use just one "über-instruction" –one really really big number –that contains all the program instructions encoded into it! This is how Minsky solves the problem, but the Gödel numbering he uses represents a great inconvenience to the model, and the result is nothing at all like our intuitive notion of a "stored program computer".*

*Elgot and Robinson (1964) come to a similar conclusion with respect to a RASP that is "finitely determined". Indeed it can access an unbounded number of registers (e.g. to fetch instructions from them) but only if the RASP allows "self modification" of its program instructions, and has encoded its "data" in a Gödel number (Fig. 2 p. 396).*

*In the context of a more computer-like model using his RPT (repeat) instruction Minsky (1967) tantalizes us with a solution to the problem (cf p. 214, p. 259) but offers no firm resolution. He asserts:*

*"In general a RPT operation could not be an instruction in the finite-state part of the machine ... this might exhaust any particular amount of storage allowed in the finite part of the computer [sic, his name for his RAM models]. RPT operations require infinite registers of their own." (p. 214).*

*He offers us a bounded RPT that together with CLR (r) and INC (r) can compute any primitive recursive function, and he offers the unbounded RPT quoted above that as playing the role of μ operator; it together with CLR (r) and INC (r) can compute the mu recursive functions. But he does not discuss "indirection" or the RAM model per se.*

*From the references in Hartmanis (1971) it appears that Cook (in his lecture notes while at UC Berkeley, 1970) has firmed up the notion of indirect addressing. This becomes clearer in the paper of Cook and Reckhow (1973) –Cook is Reckhow's Master's thesis advisor. Hartmanis' model –quite similar to Melzak's (1961) model –uses two and three-register adds and subtracts and two parameter copies; Cook and Reckhow's model reduce the number of parameters (registers called out in the program instructions) to one call-out by use of an accumulator "AC".*

**The solution in a nutshell:** Design our machine/model with unbounded **indirection** –provide an *unbounded* "address" register that can potentially name (call out) any register no matter how many there are. For this to work, in general, the *unbounded* register requires an ability to be cleared and then incremented (and, possibly, decremented) by a potentially infinite loop. In this sense the solution represents the unbounded μ operator that can, if necessary, hunt ad infinitim along the unbounded string of registers until it finds what it is looking for. The pointer register is exactly like any other register with one exception: under the circumstances called "indirect addressing" it provides *its* contents, rather than the address-operand in the state machine's TABLE, to be the address of the target register (including possibly itself!).

*If we eschew the Minsky approach of one monster number in one register, and specify that our machine model will be "like a computer" we have to confront this problem of indirection if we are to compute the recursive functions (also called the μ-recursive functions ) –both total and partial varieties.*

*Our simpler counter-machine model can do a "bounded" form of indirection –and thereby compute the sub-class of primitive recursive functions –by using a primitive recursive "operator" called "definition by cases" (defined in Kleene (1952) p. 229 and Boolos-Burgess-Jeffrey p. 74). Such a "bounded indirection" is a laborious, tedious affair. "Definition by cases" requires the machine to determine/distinguish the contents of the pointer register by attempting, time after time until success, to match this contents against a number/name that the case operator explicitly declares. Thus the definition by cases starts from e.g. the lower bound address and continues ad nauseam toward the upper bound address attempting to make a match:*

*Is the number in register N equal to 0? If not then is it equal to 1? 2? 3? ... 65364? If not then we're at the last number 65365 and this had better be the one, else we have a problem!*

*"Bounded" indirection will not allow us to compute the partial recursive functions –for those we need unbounded indirection aka the μ operator.*

*Suppose we had been able to continue on to number 65367, and in fact that register had what we were looking for. Then we could have completed our calculation successfully! But suppose 65367 didn't have what we needed. How far should we continue to go?*

*To be Turing equivalent the counter machine needs to either use the unfortunate single-register Minsky Gödel number method, or be augmented with an ability to explore the ends of its register string, ad infinitum if necessary. (A failure to find something "out there" defines what it means for an algorithm to fail to terminate; cf Kleene (1952) pp. 316ff Chapter XII Partial Recursive Functions, in particular p. 323-325.) See more on this in the example below.*

*For unbounded indirection we require a "hardware" change in our machine model. Once we make this change the model is no longer a counter machine, but rather a random-access machine.*

*Now when e.g. INC is specified, the finite state machine's instruction will have to specify where the address of the register of interest will come from. This where can be either (i) the state machine's instruction that provides an explicit label, or (ii) the pointer-register whose contents is the address of interest. Whenever an instruction specifies a register address it now will also need to specify an additional parameter "i/d" –"indirect/direct". In a sense this new "i/d" parameter is a "switch" that flips one way to get the direct address as specified in the instruction or the other way to get the indirect address from the pointer register (which pointer register –in some models every register can be a pointer register –is specified by the instruction). This "mutually exclusive but exhaustive choice" is yet another example of "definition by cases", and the arithmetic equivalent shown in the example below is derived from the definition in Kleene (1952) p. 229.*

*Example: CPY ( indirect*_{source}, r_{source}, direct_{destination}, r_{destination})

*Assign a code to specify direct addressing as d="0" and indirect addressing as i="1". Then our machine can determine the source address as follows:*- i*[r
_{s}] + (1-i)*r_{s}

- i*[r
*For example, suppose the contents of register 3 are "5" (i.e. [3]=5 ) and the contents of register 4 are "2" (i.e. [4]=2 ):*

*Example: CPY ( 1, 3, 0, 4 ) = CPY ( indirect, reg 3, direct, reg 4 )*- 1*[3] + 0*3 = [3] = source-register address 5
- 0*[4] + 1*4 = 4 = destination-register address 4

*Example: CPY ( 0, 3, 0, 4 )*- 0*[3] + 1*3 = 3 = source-register address 3
- 0*[4] + 1*4 = 4 = destination-register address 4

*Example: CPY ( 0, 3, 1, 4 )*- 0*[3] + 1*3 = 3 = source-register address 3
- 1*[4] + 0*4 = [4] = destination-register address 2

*Probably the most useful of the added instructions is COPY. Indeed, Elgot-Robinson (1964) provide their models P _{0} and P'_{0} with the COPY instructions, and Cook-Reckhow (1973) provide their accumulator-based model with only two indirect instructions –COPY to accumulator indirectly, COPY from accumulator indirectly.*

**A plethora of instructions**: Because any instruction acting on a single register can be augmented with its indirect "dual" (including conditional and unconditional jumps, cf the Elgot-Robinson model), the inclusion of indirect instructions will double the number of single parameter/register instructions (e.g. INC (d, r), INC (i, r)). Worse, every two parameter/register instruction will have 4 possible varieties, e.g.:

*CPY (d, r*_{s}, d, r_{d}) = COPY directly from source-register directly to destination-register*CPY (i, r*_{sp}, d, r_{d}) = COPY to destination-register indirectly using the source address to be found in the source-pointer register r_{sp}.*CPY (d, r*_{s}, i, r_{dp}) = COPY contents of source-register indirectly into register using destination address to be found in the destination-pointer register r_{dp}.*CPY (i, r*_{sp}, i, r_{dp}) = COPY indirectly the contents of the source register with address to be found in source-pointer register r_{sp}, into the destination register with address to be found in the destination-pointer register r_{dp})

*In a similar manner every three-register instruction that involves two source registers r _{s1} r_{s2} and a destination register r_{d} will result in 8 varieties, for example the addition:*

*[r*_{s1}] + [r_{s2}] → r_{d}

*will yield:*

*ADD ( d, r*_{s1}, d, r_{s2}, d, r_{d})*ADD ( i, r*_{sp1}, d, r_{s2}, d, r_{d})*ADD ( d, r*_{s1}, i, r_{sp2}, d, r_{d})*ADD ( i, r*_{sp1}, i, r_{sp2}, d, r_{d})*ADD ( d, r*_{s1}, d, r_{s2}, i, r_{dp})*ADD ( i, r*_{sp1}, d, r_{s2}, i, r_{dp})*ADD ( d, r*_{s1}, i, r_{sp2}, i, r_{dp})*ADD ( i, r*_{sp1}, i, r_{sp2}, i, r_{dp})

*If we designate one register to be the "accumulator" (see below) and place strong restrictions on the various instructions allowed then we can greatly reduce the plethora of direct and indirect operations. However, one must be sure that the resulting reduced instruction-set is sufficient, and we must be aware that the reduction will come at the expense of more instructions per "significant" operation.*

*Historical convention dedicates a register to the accumulator, an "arithmetic organ" that literally accumulates its number during a sequence of arithmetic operations:*

*"The first part of our arithmetic organ ... should be a parallel storage organ which can receive a number and add it to the one already in it, which is also able to clear its contents and which can store what it contains. We will call such an organ an**Accumulator*. It is quite conventional in principle in past and present computing machines of the most varied types, e.g. desk multipliers, standard IBM counters, more modern relay machines, the ENIAC" (boldface in original: Goldstine and von Neumann, 1946; p. 98 in Bell and Newell 1971).

*However, the accumulator comes at the expense of more instructions per arithmetic "operation", in particular with respect to what are called 'read-modify-write' instructions such as "Increment indirectly the contents of the register pointed to by register r2 ". "A" designates the "accumulator" register A:*

Label | Instruction | A | r2 | r378,426 | Description | |
---|---|---|---|---|---|---|

. . . | 378,426 | 17 | ||||

INCi ( r2 ): | CPY ( i, r2, d, A ) | 17 | 378,426 | 17 | Contents of r2 points to r378,426 with contents "17": copy this to A | |

INC ( A ) | 18 | 378,426 | 17 | Incement contents of A | ||

CPY ( d, A, i, r2 ) | 18 | 378,426 | 18 | Contents of r2 points to r378,426: copy contents of A into r378,426 |

*If we stick with a specific name for the accumulator, e.g. "A", we can imply the accumulator in the instructions, for example,*

*INC ( A ) = INCA*

*However, when we write the CPY instructions without the accumulator called out the instructions are ambiguous or they must have empty parameters:*

*CPY ( d, r2, d, A ) = CPY (d, r2, , )**CPY ( d, A, d, r2 ) = CPY ( , , d, r2)*

*Historically what has happened is these two CPY instructions have received distinctive names; however, no convention exists. Tradition (e.g. Knuth's (1973) imaginary MIX computer) uses two names called LOAD and STORE. Here we are adding the "i/d" parameter:*

*LDA ( d/i, r*_{s}) =_{def}CPY ( d/i, r_{s}, d, A )*STA ( d/i, r*_{d}) =_{def}CPY ( d, A, d/i, r_{d})

*The typical accumulator-based model will have all its two-variable arithmetic and constant operations (e.g. ADD (A, r), SUB (A, r) ) use (i) the accumulator's contents, together with (ii) a specified register's contents. The one-variable operations (e.g. INC (A), DEC (A) and CLR (A) ) require only the accumulator. Both instruction-types deposit the result (e.g. sum, difference, product, quotient or remainder) in the accumulator.*

*Example: INCA = [A] +1 → A**Example: ADDA (r*_{s}) = [A] + [r_{s}] → A*Example: MULA (r*_{s}) = [A] * [r_{s}] → A

*If we so choose, we can abbreviate the mnemonics because at least one source-register and the destination register is always the accumulator A. Thus we have :*

*{ LDA (i/d, r*_{s}), STA (i/d, r_{d}), CLRA, INCA, DECA, ADDA (r_{s}), SUBA (r_{s}), MULA (r_{s}), DIVA (r_{s}), etc.)

*If our model has an unbounded accumulator can we bound all the other registers? Not until we provide for at least one unbounded register from which we derive our indirect addresses.*

*The minimimalist approach is to use itself (Schönhage does this).*

*Another approach (Schönhage does this too) is to declare a specific register the "indirect address register" and confine indirection relative to this register (Schonhage's RAM0 model uses both A and N registers for indirect as well as direct instructions). Again our new register has no conventional name –perhaps "N" from "iNdex", or "iNdirect" or "address Number".*

*For maximum flexibility, as we have done for the accumulator A –we will consider N just another register subject to increment, decrement, clear, test, direct copy, etc. Again we can shrink the instruction to a single-parameter that provides for direction and indirection, for example.*

*LDAN (i/d) = CPY (i/d, N, d, A); LoaD Accumulator via iNdirection register**STAN (i/d) = CPY (d, A, i/d, N). STore Accumlator via iNdirection register*

*Why is this such an interesting approach? At least two reasons:*

**(1) An instruction set with no parameters:**

*Schönhage does this to produce his RAM0 instruction set. See section below.*

**(2) Reduce a RAM to a Post-Turing machine:**

*Posing as minimalists, we reduce all the registers excepting the accumulator A and indirection register N e.g. r = { r0, r1, r2, ... } to an unbounded string of (very-) bounded-capacity pigeon-holes. These will do nothing but hold (very-) bounded numbers e.g. a lone bit with value { 0, 1 }. Likewise we shrink the accumulator to a single bit. We restrict any arithmetic to the registers { A, N }, use indirect operations to pull the contents of registers into the accumulator and write 0 or 1 from the accumulator to a register:*

*{ LDA (i, N), STA (i, N), CLR (A/N), INC (A/N), DEC(N), JZ (A/N, I*_{z}), JZ (I_{z}), H }

*We push further and eliminate A altogether by the use of two "constant" registers called "ERASE" and "PRINT": [ERASE]=0, [PRINT]=1.*

*{ CPY (d, ERASE, i, N), CPY (d, PRINT, i, N), CLR (N), INC (N), DEC (N), JZ (i, N, I*_{z}), JZ (I_{z}), H }

*Rename the COPY instructions and call INC (N) = RIGHT, DEC (N) = LEFT and we have the same instructions as the Post-Turing machine, plus an extra CLRN :*

*{ ERASE, PRINT, CLRN, RIGHT, LEFT, JZ (i, N, I*_{z}), JZ (I_{z}), H }

*In the section above we informally showed that a RAM with an unbounded indirection capability produces a Post–Turing machine. The Post–Turing machine is Turing equivalent, so we have shown that the RAM with indirection is Turing equivalent.*

*We give here a slightly more formal demonstration. Begin by designing our model with three reserved registers "E", "P", and "N", plus an unbounded set of registers 1, 2, ..., n to the right. The registers 1, 2, ..., n will be considered "the squares of the tape". Register "N" points to "the scanned square" that "the head" is currently observing. The "head" can be thought of as being in the conditional jump –observe that it uses indirect addressing (cf Elgot-Robinson p. 398). As we decrement or increment "N" the (apparent) head will "move left" or "right" along the squares. We will move the contents of "E"=0 or "P"=1 to the "scanned square" as pointed to by N, using the indirect CPY.*

*The fact that our tape is left-ended presents us with a minor problem: Whenever LEFT occurs our instructions will have to test to determine whether or not the contents of "N" is zero; if so we should leave its count at "0" (this is our choice as designers –for example we might have the machine/model "trigger an event" of our choosing).*

*Instruction set 1 (augmented): { INC (N), DEC (N), CLR (N), CPY (d, r*_{s},i, N), JZ ( i, r, z ), HALT }

*The following table both defines the Post-Turing instructions in terms of their RAM equivalent instructions and gives an example of their functioning. The (apparent)location of the head along the tape of registers r0-r5 . . . is shown shaded:*

Mnemonic | label: | E | P | N | r0 | r1 | r2 | r3 | r4 | r5 | etc. | Action on registers | Action on finite state machine Instruction Register IR | |||
---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|---|

start: | 0 | 1 | 3 | 1 | 0 | |||||||||||

R | right: | INC ( N ) | 0 | 1 | 4 | 1 | 0 | [N] +1 → N | [IR] +1 → IR | |||||||

P | print: | CPY ( d, P, i, N ) | 0 | 1 | 4 | 1 | 1 | [P]=1 → [N]=r4 | [IR] +1 → IR | |||||||

E | erase: | CPY ( d, E, i, N ) | 0 | 1 | 4 | 1 | 0 | [E]=0 → [N]=r4 | [IR] +1 → IR | |||||||

L | left: | JZ ( i, N, end ) | 0 | 1 | 4 | 1 | 0 | none | IF N =r4] =0 THEN "end" → IR else [IR]+1 → IR | |||||||

DEC ( N ) | 0 | 1 | 3 | 1 | 0 | [N] -1 → N | ||||||||||

J0 ( halt ) | jump_if_blank: | JZ ( i, N, end ) | 0 | 1 | 3 | 1 | 0 | none | IF N =r3] =0 THEN "end" → IR else [IR]+1 → IR | |||||||

J1 ( halt ) | jump_if_mark: | JZ ( i, N, halt ) | 0 | 1 | 3 | 1 | 0 | N =r3] → A | IF N =r3] =0 THEN "end" → IR else [IR]+1 → IR | |||||||

end | . . . etc. | 0 | 1 | 3 | 1 | 0 | ||||||||||

halt: | H | 0 | 1 | 3 | 1 | 0 | none | [IR] +1 → IR |

*Throughout this demonstration we have to keep in mind that the instructions in the finite state machine's TABLE is bounded, i.e. finite:*

*"Besides a merely being a**finite set of rules*which gives a sequence of operations for solving a specific type of problem, an algorithm has five important features [Finiteness, Definiteness, Input, Output, Effectiveness]" (italics added, Knuth p. 4-7).

*The difficulty arises because the registers have explicit "names" (numbers) and our machine must call each out by name in order to "access" it.*

*We will build the indirect CPY ( i, q, d, φ ) with the CASE operator. The address of the target register will be specified by the contents of register "q"; once the CASE operator has determined what this number is, CPY will directly deposit the contents of the register with that number into register "φ". We will need an additional register that we will call "y" –it serves as an up-counter.*

*So the following is actually a constructive demonstration or proof that we can indeed simulate the indirect CPY ( i, q, d, φ ) without a "hardware" design change to our counter machine/model. However, note that because this indirect CPY is "bounded" by the size/extent of the finite state machine, a RASP using this indirect CPY can only calculate the primitive recursive functions, not the full suite of mu recursive functions.*

*The CASE "operator" is described in Kleene (1952) (p. 229) and in Boolos-Burgess-Jeffrey (2002) (p. 74); the latter authors emphasize its utility. The following definition is per Kleene but modified to reflect the familiar "IF-THEN-ELSE" construction.*

*The CASE operator "returns" a natural number into φ depending on which "case" is satisfied, starting with "case_0" and going successively through "case_last"; if no case is satisfied then the number called "default" (aka "woops") is returned into φ (here x designates some selection of parameters, e.g. register q and the string r0, ... rlast )):*

*Definition by cases* φ (**x**, y):

*case_0: IF Q*_{0}(**x**, y) is true THEN φ_{0}(**x**, y) ELSE*case_1: IF Q*_{1}(**x**, y) is true THEN φ_{1}(**x**, y) ELSE*cases_2 through case_next_to_last: etc. . . . . . . . . ELSE**case_last: IF Q*_{last}(**x**, y) is true THEN φ_{last}(**x**, y) ELSE*default: do φ*_{default}(**x**, y)

*Kleene require that the "predicates" Q _{n} that doing the testing are all mutually exclusive –"predicates" are functions that produce only { true, false } for output; Boolos-Burgess-Jeffrey add the requirement that the cases are "exhaustive".*

*We begin with a number in register q that represents the address of the target register. But what is this number? The "predicates" will test it to find out, one trial after another: JE (q, y, z) followed by INC (y). Once the number is identified explicitly, the CASE operator directly/explicitly copies the contents of this register to φ:*

*Definition by cases*CPY (i, q, d, φ) =_{def}φ (q, r0, ..., rlast, y) =- case_0: IF CLR (y), [q] - [y]=0 THEN CPY ( r0, φ ), J (exit) ELSE
- case_1: IF INC (y), [q] = [y]=1 THEN CPY ( r1, φ ), J (exit) ELSE
- case_2 through case n: IF . . . THEN . . . ELSE
- case_n: IF INC (y), [q] = [y]=n THEN CPY ( rn, φ ), J (exit) ELSE
- case_n+1 to case_last: IF . . . THEN . . . ELSE
- case_last: IF INC (y), [q] = [y]="last" THEN CPY ( rlast, φ ), J (exit) ELSE
- default: woops

*Case_0 ( the base step of the recursion on y) looks like this:*

*case_0*:

*CLR ( y ) ; set register y = 0**JE ( q, y,**_φ0*)*J (**case_1*)

*_φ0:*CPY ( r0, φ )*J (**exit*)

*case_1:*etc.

*Case_n (the induction step) looks like this; remember, each instance of "n", "n+1", ..., "last" must be an explicit natural number:*

*case_n*:

*INC ( y )**JE ( q, y,**_φn*)*J (**case_n+1*)

*_φn:*CPY ( rn, φ )*J (**exit*)

*case__n+1:*etc.

*Case_last stops the induction and bounds the CASE operator (and thereby bounds the "indirect copy" operator):*

*case_last*:

*INC ( y )**JE ( q, y,**_φlast*)*J (**woops*)

*_φlast*: CPY ( rlast, φ )*J (**exit*)

*woops:*how do we handle an out-of-bounds attempt?*exit:*etc.

*If the CASE could continue ad infinitum it would be the mu operator. But it can't –its finite state machine's "state register" has reached its maximum count (e.g. 65365 = 11111111,11111111 _{2} ) or its table has run out of instructions; it is a finite machine, after all.*

*The commonly encountered Cook and Rechkow model is a bit like the ternary-register Malzek model (written with Knuth mnemonics –the original instructions had no mnemonics excepting TRA, Read, Print).*

`LOAD ( C, r`

, C is any integer_{d}) ; C → r_{d}

*Example:*`LOAD ( 0, 5 )`

will clear register 5.

`ADD ( r`

, the registers can be the same or different;_{s1}, r_{s2}, r_{d}) ; [r_{s1}] + [r_{s2}] → r_{d}

*Example:*`ADD ( A, A, A )`

will double the contents of register A.

`SUB ( r`

, the registers can be the same or different:_{s1}, r_{s2}, r_{d}) ; [r_{s1}] - [r_{s2}] → r_{d}

*Example:*`SUB ( 3, 3, 3 )`

will clear register 3.

`COPY ( i, r`

, Indirectly copy the contents of the source-register pointed to by pointer-register r_{p}, d, r_{d}) ; [[r_{p}] ] → r_{d}_{p}into the destination register.`COPY ( d, r`

. Copy the contents of source register r_{s}, i, r_{p}) ; [r_{s}] → [r_{p}]_{s}into the destination-register pointed to by the pointer-register r_{p}.`JNZ ( r, I`

Conditional jump if [r] is positive; i.e. IF [r] > 0 THEN jump to instruction z else continue in sequence (Cook and Reckhow call this: "TRAnsfer control to line m if Xj > 0")_{z}) ;`READ ( r`

copy "the input" into destination register r_{d}) ;_{d}`PRINT ( r`

copy the contents of source register r_{s}) ;_{s}to "the output."

*Schönhage (1980) describes a very primitive, atomized model chosen for his proof of the equivalence of his SMM pointer machine model:*

*"In order to avoid any explicit addressing the RAM0 has the accumulator with contents**z*and an additional address register with current contents*n*(initially 0)" (p. 494)

**RAM1 model**: Schönhage demonstrates how his construction can be used to form the more common, usable form of "successor"-like RAM (using this article's mnemonics):

`LDA k ; k --> A`

, k is a constant, an explicit number such as "47"`LDA ( d, r ) ; [r] → A ;`

directly load A`LDA ( i, r ) ; [[r]] → A ;`

indirectly load A`STA ( d, r ) ; [A] → r ;`

directly store A`STA ( i, r ) ; [A] → [r] ;`

indirectly store A`JEA ( r, z ) ; IF [A] = [r] then I`

_{z}else continue`INCA ; [A] + 1 --> A`

**RAM0 model**: Schönhage's RAM0 machine has 6 instructions indicated by a single letter (the 6th "C xxx" seems to involve 'skip over next parameter'. Schönhage designated the accumulator with "z", "N" with "n", etc. Rather than Schönhage's mnemonics we will use the mnemonics developed above.

`(Z), CLRA: 0 → A`

`(A), INCA: [A] +1 → A`

`(N), CPYAN: [A] → N`

`(A), LDAA: [[A]] → A`

; contents of A points to register address; put register's contents into A`(S), STAN: [A] → [N]`

; contents of N points to register address; put contents of A into register pointed to by N`(C), JAZ ( z ): [A] = 0 then go to I`

; ambiguous in his treatment_{z}

*Indirection comes (i) from CPYAN (copy/transfer contents A to N) working with store_A_via_N STAN, and from (ii) the peculiar indirection instruction LDAA ( [[A]] → [A] ).*

*The definitional fact that any sort of counter machine without an unbounded register-"address" register must specify a register "r" by name indicates that the model requires "r" to be finite, although it is "unbounded" in the sense that the model implies no upper limit to the number of registers necessary to do its job(s). For example, we do not require r < 83,617,563,821,029,283,746 nor r < 2^1,000,001, etc.*

*Thus our model can "expand" the number of registers, if necessary to perform a certain computation. However this**does*mean that whatever number the model expands to must be*finite*–it must be indexable with a natural number:*ω is not an option*.

*We can escape this restriction by providing an unbounded register to provide the address of the register that specifies an indirect address.*

*In computability theory, Rice's theorem states that all non-trivial, semantic properties of programs are undecidable. A semantic property is one about the program's behavior, unlike a syntactic property. A property is non-trivial if it is neither true for every computable function, nor false for every computable function.*

*A one instruction set computer (OISC), sometimes called an ultimate reduced instruction set computer (URISC), is an abstract machine that uses only one instruction – obviating the need for a machine language opcode. With a judicious choice for the single instruction and given infinite resources, an OISC is capable of being a universal computer in the same manner as traditional computers that have multiple instructions. OISCs have been recommended as aids in teaching computer architecture and have been used as computational models in structural computing research.*

**Computability** is the ability to solve a problem in an effective manner. It is a key topic of the field of computability theory within mathematical logic and the theory of computation within computer science. The computability of a problem is closely linked to the existence of an algorithm to solve the problem.

* In computability theory, the μ-operator, minimization operator, or unbounded search operator searches for the least natural number with a given property. Adding the μ-operator to the five primitive recursive operators makes it possible to define all computable functions.*

**Addressing modes** are an aspect of the instruction set architecture in most central processing unit (CPU) designs. The various addressing modes that are defined in a given instruction set architecture define how machine language instructions in that architecture identify the operand(s) of each instruction. An addressing mode specifies how to calculate the effective memory address of an operand by using information held in registers and/or constants contained within a machine instruction or elsewhere.

*The COP8 microcontroller from National Semiconductor is an 8-bit CISC core microcontroller, whose main features are:*

**Computable functions** are the basic objects of study in computability theory. Computable functions are the formalized analogue of the intuitive notion of algorithm, in the sense that a function is computable if there exists an algorithm that can do the job of the function, i.e. given an input of the function domain it can return the corresponding output. Computable functions are used to discuss computability without referring to any concrete model of computation such as Turing machines or register machines. Any definition, however, must make reference to some specific model of computation but all valid definitions yield the same class of functions. Particular models of computability that give rise to the set of computable functions are the Turing-computable functions and the μ-recursive functions.

*A Post–Turing machine is a "program formulation" of an especially simple type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model of computation described below. A Post–Turing machine uses a binary alphabet, an infinite sequence of binary storage locations, and a primitive programming language with instructions for bi-directional movement among the storage locations and alteration of their contents one at a time. The names "Post–Turing program" and "Post–Turing machine" were used by Martin Davis in 1973–1974. Later in 1980, Davis used the name "Turing–Post program".*

**Recursion** in computer science is a method of solving a problem where the solution depends on solutions to smaller instances of the same problem. The approach can be applied to many types of problems, and recursion is one of the central ideas of computer science.

The power of recursion evidently lies in the possibility of defining an infinite set of objects by a finite statement. In the same manner, an infinite number of computations can be described by a finite recursive program, even if this program contains no explicit repetitions.

*In logic, finite model theory, and computability theory, Trakhtenbrot's theorem states that the problem of validity in first-order logic on the class of all finite models is undecidable. In fact, the class of valid sentences over finite models is not recursively enumerable.*

*A Turing machine is a hypothetical computing device, first conceived by Alan Turing in 1936. Turing machines manipulate symbols on a potentially infinite strip of tape according to a finite table of rules, and they provide the theoretical underpinnings for the notion of a computer algorithm.*

**Algorithm characterizations** are attempts to formalize the word algorithm. Algorithm does not have a generally accepted formal definition. Researchers are actively working on this problem. This article will present some of the "characterizations" of the notion of "algorithm" in more detail.

*In mathematics, logic and computer science, a formal language is called recursive if it is a recursive subset of the set of all possible finite sequences over the alphabet of the language. Equivalently, a formal language is recursive if there exists a total Turing machine that, when given a finite sequence of symbols as input, accepts it if it belongs to the language and rejects it otherwise. Recursive languages are also called decidable.*

*The 12-bit ND812, produced by Nuclear Data, Inc., was a commercial minicomputer developed for the scientific computing market. Nuclear Data introduced it in 1970 at a price under $10,000.*

*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. 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 –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. 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 A. Cook and Robert A. Reckhow (1973),**Time-bounded random access machines*, Journal of Computer Systems Science 7(4):354-375.*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. 365–399.*J. Hartmanis (1971), "Computational Complexity of Random Access Stored Program Machines," Mathematical Systems Theory 5, 3 (1971) pp. 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."*Marvin Minsky (1961, received August 15, 1960). "Recursive Unsolvability of Post's Problem of 'Tag' and Other Topics in Theory of Turing Machines".**Annals of Mathematics*. The Annals of Mathematics, Vol. 74, No. 3.**74**(3): 437–455. doi:10.2307/1970290. JSTOR 1970290.Check date values in:`|date=`

(help)*Marvin Minsky (1967).**Computation: Finite and Infinite Machines*(1st ed.). Englewood Cliffs, N. J.: Prentice-Hall, Inc. 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 of 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.*Ershov, A. P.**On operator algorithms*, (Russian) Dok. Akad. Nauk 122 (1958), 967-970. English translation, Automat. Express 1 (1959), 20-23.*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. 36–37*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's 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.*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.

Text is available under the CC BY-SA 4.0 license; additional terms may apply.

Images, videos and audio are available under their respective licenses.