Everything About ___
Live briefing

Everything about Abstract machine

Theoretical model

In computer science, an abstract machine is a theoretical model that allows for a detailed and precise analysis of how a computer system functions. It is similar to a mathematical function in that it receives inputs and produces outputs based on predefined rules. Abstract machines vary from literal machines in that they are expected to perform correctly and independently of hardware. Abstract machines are "machines" because they allow step-by-step execution of programs; they are "abstract" because they ignore many aspects of actual (hardware) machines. A typical abstract machine consists of a definition in terms of input, output, and the set of allowable operations used to turn the former into the latter. They can be used for purely theoretical reasons as well as models for real-world computer systems. In the theory of computation, abstract machines are often used in thought experiments regarding computability or to analyse the complexity of algorithms. This use of abstract machines is fundamental to the field of computational complexity theory, such as with finite state machines, Mealy machines, push-down automata, and Turing machines. Wikipedia →

🧭 Start here: a 6-step reading path

  1. Read the overview: Abstract machineA 5-minute orientation
  2. Skim a recent paper: Semi-automated title-abstract screening using natural language processing and machine learningInfluential work since 2022
  3. Pick up a classic book: Hiroshi SugimotoThe most-reprinted book on the subject
  4. Read the landmark paper: The chemical abstract machineCited 530 times
  5. Go sideways: Stack machineA closely related topic
  6. Go sideways: Computer programA closely related topic

📖 Definitions

No dictionary entry for this exact phrase.

🏆 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