Model of computation
•
Educational software
Educational abstract machines
Turing machine
Turing machine
A Turing machine is a hypothetical device that manipulates symbols on a strip of tape according to a table of rules. Despite its simplicity, a Turing machine can be adapted to simulate the logic of an...
Turing machine - Wikipedia
MIX
MIX is a hypothetical computer used in Donald Knuth's monograph, The Art of Computer Programming (TAOCP). MIX's model number is 1009, which was derived by combining the model numbers and names of sev...
Log-space transducer
A log space transducer (LST) is a type of Turing machine used for log-space reductions.A log space transducer, , has three tapes: will be designed to compute a log-space computable function (where i...
MikroSim
MikroSim is an educational software computer program for hardware-non-specific explanation of the general functioning and behaviour of a virtual processor, running on the Microsoft Windows operating s...
MikroSim - Wikipedia
Crossing sequence (Turing machines)
In theoretical computer science, a crossing sequence at boundary i, denoted as or sometimes , is the sequence of states of a Turing machine on input x, such that in this sequence of states, the head...
Probabilistic Turing machine
In computability theory, a probabilistic Turing machine is a non-deterministic Turing machine which randomly chooses between the available transitions at each point according to some probability distr...
MIC-1
The MIC-1 is a processor architecture invented by Andrew S. Tanenbaum to use as a simple but complete example in his teaching book Structured Computer Organization.It consists of a very simple control...
MMIX
MMIX (pronounced em-mix) is a 64-bit RISC architecture designed by Donald Knuth, with significant contributions by John L. Hennessy (who contributed to the design of the MIPS architecture) and Richard...
MMIX - Wikipedia
Machine that always halts
In computability theory, a machine that always halts—also called a decider (Sipser, 1996) or a total Turing machine (Kozen, 1997)—is a Turing machine that halts for every input.Because it always halts...
V.Flash
V.Flash is a spinoff from the Vtech V.Smile series of educational game consoles. Unlike the V.Smile, this game console uses 3D graphics.
Unlike major disc-based game systems of today and previous ...
Mano machine
The Mano machine is a computer theoretically described by M. Morris Mano. It contains a central processing unit, random access memory, and an input-output bus. Its limited instruction set and small ad...
Multi-track Turing machine
A Multitrack Turing machine is a specific type of Multi-tape Turing machine. In a standard n-tape Turing machine, n heads move independently along n tracks. In a n-track Turing machine, one head reads...
Read-only right moving Turing machines
Read-only right moving Turing machines are a particular type of Turing machine.
The definition based on a single infinite tape defined to be a 7-tuple whereIn the case of these types of Turing Ma...
Read-only right moving Turing machines - Wikipedia
Playware
Playware is hardware and software that aims at producing play and playful experiences among its users.Examples of playware products are numerous with computer games as the most widespread and successf...
Non-deterministic Turing machine
In theoretical computer science, a Turing machine is a theoretical machine that is used in thought experiments to examine the abilities and limitations of computers.In essence, a Turing machine is ima...
DLX
The DLX (pronounced "Deluxe") is a RISC processor architecture designed by John L. Hennessy and David A. Patterson, the principal designers of the Stanford MIPS and the Berkeley RISC designs (respecti...
Little man computer
The Little Man Computer (LMC) is an instructional model of a computer, created by Dr. Stuart Madnick in 1965. The LMC is generally used to teach students, because it models a simple von Neumann archit...
Post–Turing machine
A Post–Turing machine is a "program formulation" of an especially simple type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model of computation described below. (Post's mo...
Post–Turing machine - Wikipedia
Simplified Instructional Computer
The Simplified Instructional Computer (also abbreviated SIC) is a hypothetical computer system introduced in System Software: An Introduction to Systems Programming, by Leland Beck. Due to the fact th...
LogP machine
The LogP machine is a model for parallel computation.It aims at being more practical than the PRAM model while still allowing for easy analysis of computation.The name is not related to the mathematic...
Multi-string Turing machine with input and output
A Turing machine is a hypothetical device that manipulates symbols on a strip of tape according to a table of rules. Despite its simplicity, a Turing machine can be adapted to simulate the logic of an...
Multi-string Turing machine with input and output - Wikipedia
Zeno machine
In mathematics and computer science, Zeno machines (abbreviated ZM, and also called accelerated Turing machine, ATM) are a hypothetical computational model related to Turing machines that allows a cou...