Live briefing
Everything about Random-access machine
Abstract model of computation
In computer science, random-access machine is a model of computation that describes an abstract machine in the general class of register machines. The RA-machine is very similar to the counter machine but with the added capability of 'indirect addressing' of its registers. The 'registers' are intuitively equivalent to main memory of a common computer, except for the additional ability of registers to store natural numbers of any size. Like the counter machine, the RA-machine contains the execution instructions in the finite-state portion of the machine. Wikipedia →
🧠Start here: a 6-step reading path
- Read the overview: Random-access machineA 5-minute orientation
- Pick up a classic book: Turing's cathedralThe most-reprinted book on the subject
- Read the landmark paper: Fast Simulation of Turing Machines by Random Access MachinesCited 17 times
- Go sideways: Counter machineA closely related topic
- Go sideways: Register machineA closely related topic
đź“– Definitions
No dictionary entry for this exact phrase.
🗂️ The subject at a glance
🏆 Landmark papers (most cited)
Fast Simulation of Turing Machines by Random Access Machines
The complexity of on-line simulations between multidimensional turing machines and random access machines
Deterministic simulation of a single tape Turing machine by a Random Access Machine in sub-linear time
Computational Complexity of Multitape Turing Machines and Random Access Machines
đź“š Books worth reading
Turing's cathedralGeorge Dyson · 2012
Turings Cathedral VintageGeorge Dyson · 2012
Turing's CathedralGeorge Dyson · 2012
Ranked by number of editions on Open Library, a rough measure of how lasting a book is.
đź”— Related topics
- 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…
- Register 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…
- 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 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…
- Pointer machine In theoretical computer science, a pointer machine is an atomistic abstract computational machine whose storage structure is a graph. A pointer algorithm…
- Mu operator In computability theory, the μ-operator, minimization operator, or unbounded search operator searches for the least natural number with a given property…
- Post–Turing machine A Post machine or Post–Turing machine is a "program formulation" of a type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model…