A register machine (RM) is a model of computation which consists of a finite sequence of instructions (I_{0}..I_{s}) and a finite set of registers (R_{1}..R_{n}) which hold non-negative integers. Each instruction can increment or decrement a register or halt the computation. Register machines are equivalent in computational power to Turing Machines.