Church's work intertwined with Turing's to form the basis for the Church–Turing thesis. This thesis states that Turing machines, lambda calculus, and other...

probabilities for the transitions, probabilistic Turing machines can be defined as deterministic Turing machines having an additional "write" instruction where...

science, a universal Turing machine (UTM) is a Turing machine capable of computing any computable sequence, as described by Alan Turing in his seminal paper...

In theoretical computer science, a nondeterministic Turing machine (NTM) is a theoretical model of computation whose governing rules specify more than...

A Turing machine is an abstract mathematical computational device named after Alan Turing; see the box for variants of this meaning. Turing machine may...

A quantum Turing machine (QTM) or universal quantum computer is an abstract machine used to model the effects of a quantum computer. It provides a simple...

cellular automaton) is said to be Turing-complete or computationally universal if it can be used to simulate any Turing machine[citation needed] (devised by...

relationship between partial Turing machines and total Turing machines: Can every partial function computable by a partial Turing machine be extended (that is...

an elder brother, John Ferrier Turing, father of Sir John Dermot Turing, 12th Baronet of the Turing baronets. Turing's father's civil service commission...

"Post–Turing program" and "Post–Turing machine" were used by Martin Davis in 1973–1974 (Davis 1973, p. 69ff). Later in 1980, Davis used the name "Turing–Post...

A Turing machine is a hypothetical computing device, first conceived by Alan Turing in 1936. Turing machines manipulate symbols on a potentially infinite...

super-Turing computation is a set of hypothetical models of computation that can provide outputs that are not Turing-computable. For example, a machine that...

Turing machine (or to be more precise, the definition of acceptance for such a machine) alternates between these modes. An alternating Turing machine...

The Turing test, originally called the imitation game by Alan Turing in 1949, is a test of a machine's ability to exhibit intelligent behaviour equivalent...

Turing machine starting from a given state ever print a given symbol?") and to the printing problem considered in Turing's 1936 paper ("does a Turing...

A neural Turing machine (NTM) is a recurrent neural network model of a Turing machine. The approach was published by Alex Graves et al. in 2014. NTMs combine...

to supplement the article Turing machine. The following table is Turing's very first example (Turing 1937): "1. A machine can be constructed to compute...

A multi-tape Turing machine is a variant of the Turing machine that utilizes several tapes. Each tape has its own head for reading and writing. Initially...

computability theory, the Church–Turing thesis (also known as computability thesis, the Turing–Church thesis, the Church–Turing conjecture, Church's thesis...

eliminating isomorphic automata. Read-only right-moving Turing machines are a particular type of Turing machine that only moves right; these are almost exactly...

Turing machine with an attached printer. The Turing machine can use that printer as an output device to print strings. Every time the Turing machine wants...

computability theory, an oracle machine is an abstract machine used to study decision problems. It can be visualized as a Turing machine with a black box, called...

order. The finite-state machine has less computational power than some other models of computation such as the Turing machine. The computational power...

programs used in the game are n-state Turing machines, one of the first mathematical models of computation. Turing machines consist of an infinite tape, and...

a register machine is a generic class of abstract machines, analogous to a Turing machine and thus Turing complete. Unlike a Turing machine that uses a...

Zeno machines (abbreviated ZM, and also called accelerated Turing machine, ATM) are a hypothetical computational model related to Turing machines that...

a universal Turing machine Turing degree equivalence (of sets), having the same level of unsolvability Turing machine equivalents Turing test (disambiguation)...

(Turing) computable, or recursive function if there is a Turing machine that, on input n, halts and returns output f(n). The use of Turing machines here...

computability theory, a Turing reduction from a decision problem A {\displaystyle A} to a decision problem B {\displaystyle B} is an oracle machine that decides...

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...