Instructions of the abstract machine can usually be represented as records.

Unlike a "real" computer model, abstract machine models allow this.

The description often takes the form of an abstract machine that is meant to perform the task at hand.

The network is represented by a set of abstract machines that can exchange messages.

It is used for classifying of programming languages and abstract machines.

To analyze an algorithm precisely, one must assume it is being executed by a particular abstract machine.

The notion of the categorical abstract machine arose in the mid-1980s and.

ALF programs are compiled into instructions of an abstract machine.

In theoretical computer science, a state transition system is an abstract machine used in the study of computation.

More complex definitions create abstract machines with full instruction sets, registers and models of memory.

It is like an abstract machine.

Undecidable problems can be related to different topics, such as logic, abstract machines or topology.

General development of complexity theory for abstract machines that compute on real numbers instead of bits.

An automaton, an abstract machine in mathematics (see automata theory)

Intermediate language - language of an abstract machine designed to aid in the analysis of computer programs.

An abstract machine implemented as a software simulation, or for which an interpreter exists, is called a virtual machine.

A counter machine is an abstract machine used in formal logic and theoretical computer science to model computation.

These abstract machines are called automata.

An abstract machine can also refer to a microprocessor design which has yet to be (or is not intended to be) implemented as hardware.

In the first and the most abstract version, which is called Abstract Machine, designer should specify the goal of the design.

In computer science, a computation history is a sequence of steps taken by an abstract machine in the process of computing its result.

Any given abstract machine will have a complexity class corresponding to the problems which can be solved in polynomial time on that machine.

Ten15 is an algebraically specified abstract machine.

The interconnection automatically reveals spaces that are left unconnected or silenced under the abstract machine of signifiers.

An approach is to take a somewhat formal taxonomic approach to classify the Turing equivalent abstract machines.