Everything about Register machine
Type of abstract computing machine
In mathematical logic and theoretical computer science, a register machine is a generic class of abstract machines, analogous to a Turing machine and thus 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 machines, pointer machines, random-access machines (RAM), and 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 machines in practical computer science, for educational purposes and reducing dependency on specific hardware architectures. Wikipedia →
🧭 Start here: a 6-step reading path
- Read the overview: Register machineA 5-minute orientation
- Skim a recent paper: A Decoupling Matrix-Based Learning Control Scheme for the Machine Directional Register of Roll-to-Roll SystemsInfluential work since 2022
- Pick up a classic book: Shift register sequencesThe most-reprinted book on the subject
- Read the landmark paper: Code Generation for a One-Register MachineCited 61 times
- Go sideways: Counter-machine modelA closely related topic
- Go sideways: Turing machine equivalentsA closely related topic
📖 Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Code Generation for a One-Register Machine
Register-Transfer-Level Features for Machine-Learning-Based Hardware Trojan Detection
A Lightweight and Machine-Learning-Resistant PUF Using Obfuscation-Feedback-Shift-Register
Machine Directional Register System Modeling for Shaft-Less Drive Gravure Printing Machines
Quantum Register Machine: Efficient Implementation of Quantum Recursive Programs
The National Cash Register Company Additive Recovery Machine
Register-machine based processes
Machine-independent register allocation
🆕 Influential since 2022
A Decoupling Matrix-Based Learning Control Scheme for the Machine Directional Register of Roll-to-Roll Systems
Individual health indices via register-based health records and machine learning
Address matching using machine learning methods: An application to register-based census
Interference Graph Dataset for Machine Learning-Based Register Allocation
“Developing machine learning models of self-reported and register-based data to predict eating disorders in adolescence”
📚 Books worth reading
- 📕Shift register sequencesSolomon W. Golomb · 1967
Before the computerJames W. Cortada · 2000
Shift register sequencesSolomon W. Golomb · 1967
Amiga C for beginnersDirk Schaun · 1987- 📕Dünya borsalarında gözlemlenen anomaliler ve İstanbul Menkul Kıymetler Borsası üzerine bir denemeTahsin Özmen · 1997
- 📕Theodore RooseveltOtto von Gottberg · 1908
- 📕Studies in feedback-shift-register synthesis of sequential machinesMartin, Robert L. · 1969
- 📕On the shift-registers sequence generatorsZdzisław Grodzki · 1971
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
🔗 Related topics
- Counter-machine model There are many variants of the counter machine, among them those of Hermes, Ershov, Péter, Minsky, Lambek, Shepherdson and Sturgis, and Schönhage. These…
- Turing machine equivalents A Turing machine is a hypothetical computing device, first conceived by Alan Turing in 1936. Turing machines manipulate symbols on a potentially infinite…
- Random-access stored-program machine In theoretical computer science the random-access stored-program (RASP) machine model is an abstract machine used for the purposes of algorithm development…
- Counter machine In formal logic and theoretical computer science, a counter machine or counter automaton is an abstract machine used to model computation. A counter machine…
- Random-access machine In computer science, random-access machine (RAM or RA-machine) is a model of computation that describes an abstract machine in the general class of register…
- Wang B-machine As presented by Hao Wang (1954, 1957), his basic machine B is an extremely simple computational model equivalent to the Turing machine. It is "the first…
- One-instruction set computer A one-instruction set computer (OISC), sometimes referred to as an ultimate reduced instruction set computer (URISC), is an abstract machine that uses…
- Turing machine A Turing machine is a mathematical model of computation describing an abstract machine that manipulates symbols on a strip of tape according to a table…