Theoretical computer used for defining a model of computation
Not to be confused with Virtual machine.
In computer science, an abstract machine is a theoretical model that allows for a detailed and precise analysis of how a computer system functions.[1] 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.[2] Abstract machines are "machines" because they allow step-by-step execution of programmes; they are "abstract" because they ignore many aspects of actual (hardware) machines.[3] 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.[2] In the theory of computation, abstract machines are often used in thought experiments regarding computability or to analyse the complexity of algorithms.[3] This use of abstract machines is fundamental to the field of computational complexity theory, such as finite state machines, Mealy machines, push-down automata, and Turing machines.[4]
^Weisstein, Eric W. "Abstract Machine". mathworld.wolfram.com. Retrieved 2022-05-16.
^ ab"What is an Abstract Machine?". EasyTechJunkie. Retrieved 2022-05-16.
^ abDiehl, Stephan; Hartel, Pieter; Sestoft, Peter (May 2000). "Abstract machines for programming language implementation". Future Generation Computer Systems. 16 (7): 739–751. doi:10.1016/S0167-739X(99)00088-6.
In computer science, an abstractmachine is a theoretical model that allows for a detailed and precise analysis of how a computer system functions. It...
In 1983, David H. D. Warren designed an abstractmachine for the execution of Prolog consisting of a memory architecture and an instruction set. This design...
The categorical abstractmachine (CAM) is a model of computation for programs that preserves the abilities of applicative, functional, or compositional...
A Turing machine is a mathematical model of computation describing an abstractmachine that manipulates symbols on a strip of tape according to a table...
In computer science, an abstract state machine (ASM) is a state machine operating on states that are arbitrary data structures (structure in the sense...
Caml (originally an acronym for Categorical AbstractMachine Language) is a multi-paradigm, general-purpose, high-level, functional programming language...
computability theory, an oracle machine is an abstractmachine used to study decision problems. It can be visualized as a Turing machine with a black box, called...
a register machine is a generic class of abstractmachines used in a manner similar to a Turing machine. All models of register machines are Turing equivalent...
The SECD machine is a highly influential (see: § Landin's contribution) virtual machine and abstractmachine intended as a target for functional programming...
A CEK Machine is an abstractmachine invented by Matthias Felleisen and Daniel P. Friedman that implements left-to-right call by value. It is generally...
Abstract State Machine Language (AsmL) is a programming language based on abstract state machines developed by Microsoft. AsmL is a functional language...
In theoretical computer science, a pointer machine is an atomistic abstract computational machine whose storage structure is a graph. A pointer algorithm...
the Wayback Machine Wang, Jing; Conder, Julie A.; Blitzer, David N.; Shinkareva, Svetlana V. (2010). "Neural Representation of Abstract and Concrete...
Abstract expressionism in the United States emerged as a distinct art movement in the immediate aftermath of World War II and gained mainstream acceptance...
acronym CAML originally stood for Categorical AbstractMachine Language, but OCaml omits this abstractmachine. OCaml is a free and open-source software project...
The Abstract Rewriting Machine (ARM) is a virtual machine which implements term rewriting for minimal term rewriting systems. Minimal term rewriting systems...
the Krivine machine is an abstractmachine (sometimes called virtual machine). As an abstractmachine, it shares features with Turing machines and the SECD...
science to describe serial algorithms in abstractmachine models, often the one known as random-access machine. Similarly, many computer science researchers...
computer science, a parallel random-access machine (parallel RAM or PRAM) is a shared-memory abstractmachine. As its name indicates, the PRAM is intended...
A quantum Turing machine (QTM) or universal quantum computer is an abstractmachine used to model the effects of a quantum computer. It provides a simple...
Schizoanalysis, then, is a form of social analysis according to abstractmachines, lines of flight or deterritorialisation, regimes of signs, the stratification...
Global Information