Editing Register machine (section)

==Notes==
{{reflist|group="nb"|refs=
<ref group="nb" name="NB1">". . . 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).</ref>
<ref group="nb" name="NB2">For example, (Lambek 1961: p. 295) proposed the use of pebbles, beads, etc.</ref>
<ref group="nb" name="NB3">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).</ref>
}}