Editing Register machine (section)

{{Short description|Type of abstract computing machine}}
{{Use dmy dates|date=May 2023|cs1-dates=y}}
{{Use list-defined references|date=May 2023}}

In [[mathematical logic]] and [[theoretical computer science]], a '''register machine''' is a generic class of [[abstract machine]]s, analogous to a [[Turing machine]] and thus [[Turing completeness|Turing complete]]. Unlike a Turing machine that uses a tape and head, a register machine utilizes multiple uniquely addressed registers to store non-negative integers. There are several sub-classes of register machines, including [[Counter machine|counter machines]], [[Pointer machine|pointer machines]], [[Random-access machine|random-access machines (RAM)]], and [[Random-access stored-program machine|Random-Access Stored-Program Machine (RASP)]], each varying in complexity. These machines, particularly in theoretical studies, help in understanding computational processes. The concept of register machines can also be applied to [[Virtual machine|virtual machines]] in practical computer science, for educational purposes and reducing dependency on specific hardware architectures.