Definition:Unlimited Register Machine/Operation/State

Definition

The state of a URM program at a particular stage is defined as:

$(1): \quad$ the value of the instruction pointer

$(2): \quad$ the values contained by each of the registers that are used by the URM program.

Also known as

The state of a URM program is also known as its situation.

Also see

• Results about unlimited register machines can be found here.

Sources

• 1963: John C. Shepherdson and H.E. Sturgis: Computability of Recursive Functions (J. ACM Vol. 10, no. 2: pp. 217 – 255)

• 1980: N.J. Cutland: Computability: An Introduction to Recursive Function Theory