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

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

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

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

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

as a never-before-published memoir by Turing's older brother John F. Turing. Turing, Sara (2012). Alan M. Turing. Cambridge University Press. ISBN 978-1-107-02058-0...

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

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

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

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

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

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

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

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

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

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 (or to be more precise, the definition of acceptance for such a machine) alternates between these modes. An alternating Turing machine...

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

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

science began to converge. In 1980, Paul Benioff introduced the quantum Turing machine, which uses quantum theory to describe a simplified computer. When digital...

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

computability notions weaker than Turing machines are studied in automata theory, while computability notions stronger than Turing machines are studied in the field...

Given a set A {\displaystyle A} , the Turing jump A ′ {\displaystyle A'} is the set of indices of oracle Turing machines that halt on input 0 {\displaystyle...

encoding for Turing machines, where an encoding is a function which associates to each Turing Machine M a bitstring <M>. If M is a Turing Machine which, on...

such as the halting problem, can be used. An oracle machine can be conceived as a Turing machine connected to an oracle. The oracle, in this context,...

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

deterministic Turing machine, but many complexity classes are based on non-deterministic Turing machines, Boolean circuits, quantum Turing machines, monotone...