Model of computation
•
Computational complexity theory
•
Alan Turing
•
List of English inventions and discoveries
•
Theoretical computer science
•
Theory of computation
Formal methods
Computability theory
Educational abstract machines
Computational complexity
Intractability (complexity)
Computing Machinery and Intelligence
1937 in computer science
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 equivalents
•
Register machine
•
Post-Turing machine
•
Universal Turing machine
•
Computational complexity theory
•
Church-Turing thesis
Another step forward on universal quantum computer
Researchers have demonstrated holonomic quantum gates under zero-magnetic field at room temperature, which could enable the realization of fast and fault-tolerant universal quantum computers.
Turing machine - Wikipedia
Turing machine equivalents
A Turing machine is a hypothetical device with an infinite memory capacity, first conceived by Alan Turing in 1936. The machine manipulates symbols on a potentially infinite strip of tape according to...
Register machine
In mathematical logic and theoretical computer science a register machine is a generic class of abstract machines used in a manner similar to a Turing machine. All the models are Turing equivalent.
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...
Universal Turing machine
In computer science, a universal Turing machine (UTM) is a Turing machine that can simulate an arbitrary Turing machine on arbitrary input. The universal machine essentially achieves this by reading b...
Computational complexity theory
Computational complexity theory is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent ...
Church-Turing thesis
In computability theory, the Church–Turing thesis (also known as the Turing–Church thesis, the Church–Turing conjecture, Church's thesis, Church's conjecture, and Turing's thesis) is a hypothesis ("t...
Combinatorial optimization
In applied mathematics and theoretical computer science, combinatorial optimization is a topic that consists of finding an optimal object from a finite set of objects. In many such problems, exhausti...
Another step forward on universal quantum computer
Researchers have demonstrated holonomic quantum gates under zero-magnetic field at room temperature, which could enable the realization of fast and fault-tolerant universal quantum computers.
Read-only Turing machine
A read-only Turing machine or Two-way deterministic finite-state automaton (2DFA) is class of models of computability that behave like a standard Turing machine and can move in both directions across ...
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...
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...
Average-case complexity
In computational complexity theory, the average-case complexity of an algorithm is the amount of some computational resource (typically time) used by the algorithm, averaged over all possible inputs. ...
Branching factor
In computing, tree data structures, and game theory, the branching factor is the number of children at each node, the outdegree. If this value is not uniform, an average branching factor can be calcu...
HO (complexity)
High-order logic is an extension of first-order and second-order with high order quantifiers. In descriptive complexity we can see that it is equal to the ELEMENTARY functions. There is a relation bet...
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...
SO (complexity)
Second-order logic is an extension of first-order with second orders quantifiers, hence the reader should first read FO (complexity) to be able to understand this article. In descriptive complexity we...
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...
Turing switch
In theoretical network science, the Turing switch is a logical construction modeling the operation of the network switch, just as in theoretical computer science a Turing machine models the operation ...
Proof (truth)
A proof is sufficient evidence or an argument for the truth of a proposition.The concept is applied in a variety of disciplines, with both the nature of the evidence or justification and the criteria...
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...
Turmite
In computer science, a turmite is a Turing machine which has an orientation as well as a current state and a "tape" that consists of an infinite two-dimensional grid of cells. The terms ant and vant a...
ACC0
ACC, sometimes called ACC, is a class of computational models and problems defined in circuit complexity, a field of theoretical computer science. The class is defined by augmenting the class AC of co...
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...
Quantum Turing machine
A quantum Turing machine (QTM), also a universal quantum computer, is an abstract machine used to model the effect of a quantum computer. It provides a very simple model which captures all of the pow...
Symmetric Turing machine
A symmetric Turing machine is a Turing machine which has a configuration graph that is undirected (that is, configuration i yields configuration j if and only if j yields i).
Formally, we define a...
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...
Morris method
In applied statistics, the Morris method for global sensitivity analysis is a so-called one-step-at-a-time method (OAT), meaning that in each run only one input parameter is given a new value. It faci...
NP-hard
NP-hard (Non-deterministic Polynomial-time hard), in computational complexity theory, is a class of problems that are, informally, "at least as hard as the hardest problems in NP". More precisely, a ...