Register machine
A register machine is a hypothetical model of computation that is equivalent in its computational power to Turing machines.
Definition
A register machine can be seen as a finite set of registers r1 ... rn, each of which can hold a non-negative integer, and a finite set of instructions I1 ... Im. Each instruction can only be either:
-
INC (j, k) — increment the value of rj by 1, then jump to instruction Ik.
-
DEC (j, k, z) — check if the value of rj is zero. If so, jump to instruction Iz; otherwise, decrement rj by 1 and jump to Ik.
-
HALT — halts the computation.
See also
This article is a stub. You can help BambooWeb by .
