Everything about Random-access stored-program machine

🧭 Start here: a 6-step reading path

1. Read the overview: Random-access stored-program machineA 5-minute orientation
2. Pick up a classic book: The Conspirators HierarchyThe most-reprinted book on the subject
3. Read the landmark paper: Random-Access Stored-Program Machines, an Approach to Programming LanguagesCited 72 times
4. Go sideways: Register machineA closely related topic
5. Go sideways: Counter machineA closely related topic

🏆 Landmark papers (most cited)

• Random-Access Stored-Program Machines, an Approach to Programming Languages

  Calvin C. Elgot, Abraham Robinson · 1964 · Journal of the ACM · 72 citations

• Computational complexity of random access stored program machines

  J. Hartmanis · 1971 · Mathematical Systems Theory · 30 citations

• Quantum random access stored-program machines

  Qisheng Wang, Mingsheng Ying · 2023 · Journal of Computer and System Sciences · 7 citations

• Microprogrammed random access stored program machines

  Carl H. Smith, J. van Leeuwen · 1974 · ACM SIGACT News · 2 citations

• A Flexible Scheme of Garbled Random Access Stored-program Machine

  Fu-Te SHANG, Chuan-Rong ZHANG · 2017 · DEStech Transactions on Computer Science and Engineering · 0 citations

• Dynamic Random-Access Stored-Program Machine for Runtime Code Modification

  Jarosław Rudy · 2015 · International Journal of Foundations of Computer Science · 0 citations

📚 Books worth reading

• The Conspirators HierarchyJohn Coleman · 1992
• The (new) turing omnibusA.K. Dewdney · 1993
• Data structures using C++D. S. Malik · 2010
• Data Structures and Algorithms in JavaMichael T. Goodrich, Roberto Tamassia · 2014
• Introduction to Programming with C++Diane Zak · 2011
• The Turing omnibusA.K. Dewdney · 1989
• Foundations of computer scienceBehrouz A. Forouzan · 2002
• IMPACTS OF RURAL ELECTRIFICATION IN RWANDA · 2015

Ranked by number of editions on Open Library, a rough measure of how lasting a book is.

🔗 Related topics

• 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…
• 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…
• 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…
• 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…
• 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…
• Addressing mode Addressing modes are an aspect of the instruction set architecture in most central processing unit (CPU) designs. Addressing modes define how the machine…
• COP8 The National Semiconductor COP8 is an 8-bit CISC core microcontroller. COP8 is an enhancement to the earlier COP400 4-bit microcontroller family. COP8…