Models of computation

abstract computation model; mathematical model of computation that defines an abstract machine which manipulates symbols on a strip of tape according to a table of rules

study of a model of computation

formal system in mathematical logic

type of automaton

family of modelling languages for distributed systems

computing using molecular biology hardware

diagram used in computer engineering and computer science

computer that uses photons or light particles

theoretical model of a computer hardware or software system used in automata theory

finite-state machine whose output values are determined both by its current state and the current inputs

mathematical model describing how an output of a function is computed given an input

type of computational models

approach of formalizing the meanings of programming languages by constructing mathematical objects (called denotations) that describe the meanings of expressions from the languages

computer system state that outlives the process that created it

Turing machine, in which computation is restricted to the portion of the tape containing the input

non-deterministic Turing machine which chooses between the available transitions at each point according to some probability distribution

programming paradigm which gives some degree of parallel processing

set of instantaneous values of all variables to which a system or computer program has access

model of quantum computing

generic class of abstract machines

the set of values that a process can take in a dynamical system

theorem that a class of control flow graphs can compute any computable function if it combines subprograms only through sequence, selection, and iteration

type of computer

systems of biologically derived molecules that perform computational processes

abstract machine used in the study of computation

model of computing

hypothetical computational model

numerical method for the valuation of financial options

string rewriting system that uses grammar-like rules to operate on strings of symbols

abstract computer for designing parallel algorithms

FRACTRAN is a Turing-complete esoteric programming language invented by the mathematician John Conway. A FRACTRAN program is an ordered list of positive fractions together with an initial positive integer input n. The program is run by updating the integer n as follows: for the first fraction f in the list for which nf is an integer, replace n by nf repeat this rule until no fraction in the list produces an integer when multiplied by n, then halt.

In computing, dataflow is a broad concept, which has various meanings depending on the application and context. In the context of software architecture, data flow relates to stream processing or reactive programming.

abstract machine that uses only one instruction

abstract computation model

A 2-state 2-color turmite on a square grid. Starting from an empty grid, after 8342 steps the turmite (a red pixel) has exhibited both chaotic and regular movement phases.|thumb|250x250px

hypothetical fault-tolerant quantum computer based on topological condensed matter

Abstract machine in computer science

system with a countable number of states

mathematical model of a complex system, e.g. weather

i/O-efficient algorithm regardless of cache size

virtual and Abstract Machine target for functional programming language compiler

state machine operating on states that are arbitrary data structures

abstract calculator

deterministic computational model

quantum computer that first prepares an entangled resource state and then performs single qubit measurements on it

P′′ (P double prime) is a primitive computer programming language created by Corrado Böhm in 1964 to describe a family of Turing machines. It provided one of the earliest formulations of the single-entry single-exit principle central to structured programming.

metric for a quantum computer's capabilities and error rates

model of computational complexity

control method

algorithm to process data that is too large to fit into a computer's main memory at one time, optimized to efficiently fetch and access data stored in slow bulk memory (e.g. hard drives, tape drives, remote network)

hypothetical computing devices

idealized model of a reversible mechanical computer