Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Register machine
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
==Overview== The register machine gets its name from its use of one or more "[[Processor register|register]]s". In contrast to the tape and head used by a [[Turing machine]], the [[model]] uses '''multiple uniquely addressed registers''', each of which holds a single non-negative [[integer]]. There are at least four sub-classes found in the [[literature]]. In ascending order of complexity: * [[Counter machine]] β the most primitive and reduced [[theoretical]] model of computer hardware. This machine lacks indirect addressing, and instructions are in the [[Finite-state machine|finite state machine]] in the manner of the [[Harvard architecture]]. * [[Pointer machine]] β a blend of the counter machine and RAM models with less common and more abstract than either model. Instructions are in the finite state machine in the manner of Harvard architecture. * [[Random-access machine]] (RAM) β a counter machine with indirect addressing and, usually, an augmented instruction set. Instructions are in the finite state machine in the manner of the Harvard architecture. * [[Random-access stored-program machine]] model (RASP) β a RAM with instructions in its registers analogous to the [[Universal Turing machine]], making it an example of the [[von Neumann architecture]]. But unlike a computer, the model is ''idealized'' with effectively infinite registers (and if used, effectively infinite special registers such as [[Accumulator (computing)|accumulators]]). As compared to a modern computer, however, the instruction set is still reduced in number and complexity. Any properly defined register machine model is [[Turing completeness|Turing complete]]. Computational speed is very dependent on the model specifics. In practical computer science, a related concept known as a [[virtual machine]] is occasionally employed to reduce reliance on underlying machine architectures. These [[Virtual machine|virtual machines]] are also utilized in educational settings. In textbooks, the term "register machine" is sometimes used interchangeably to describe a virtual machine.<ref name="Abelson-Sussman_1996"/>
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)