Definition:Unlimited Register Machine/Historical Note

From ProofWiki
Jump to navigation Jump to search

Historical Note on Unlimited Register Machine

The unlimited register machine is a more versatile and easy to understand alternative to the Turing machine, which has the same capabilities and (to a certain extent) to which it is logically equivalent.

It was introduced in a paper by John C. Shepherdson and Howard E. Sturgis published in $1963$.