Everything About ___
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

  1. Read the overview: Random-access machineA 5-minute orientation
  2. Skim a recent paper: Deep Learning Based Double-Contention Random Access for Massive Machine-Type CommunicationInfluential work since 2022
  3. Pick up a classic book: Nanocrystals in Non-Volatile MemoryThe most-reprinted book on the subject
  4. Read the landmark paper: Random access for machine-to-machine communication in LTE-advanced networks: issues and approachesCited 503 times
  5. Go sideways: Counter machineA closely related topic
  6. Go sideways: Register machineA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🗂️ The subject at a glance

  1. Informal description
  2. Introduction to the model
  3. The "indirect" operation
  4. The notion of "accumulator A"
  5. The notion of indirect address register "N"
  6. Turing equivalence of the RAM with indirection
  7. Example: Bounded indirection yields a machine that is not Turing equivalent
  8. Examples of models

🏆 Landmark papers (most cited)

🆕 Influential since 2022

📚 Books worth reading

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

🔗 Related topics