A Post machine or Post–Turing machine is a "program formulation" of a type of Turing machine, comprising a variant of Emil Post's Turing-equivalent model...

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

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

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

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

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

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

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

Post machine may refer to: Post tag system Post–Turing machine This disambiguation page lists articles associated with the title Post machine. If an internal...

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

In theoretical computer science, a Turing machine is a theoretical machine that is used in thought experiments to examine the abilities and limitations...

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

2-state 5-symbol Turing machine, and conjectured that a particular 2-state 3-symbol Turing machine (hereinafter (2,3) Turing machine) might be universal...

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

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

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 or two-way deterministic finite-state automaton (2DFA) is class of models of computability that behave like a standard Turing machine and...

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

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

capability produces a Post–Turing machine. The Post–Turing machine is Turing equivalent, so we have shown that the RAM with indirection is Turing equivalent. We...

Ferrier Turing, father of Dermot Turing, 12th Baronet of the Turing baronets. Turing's father's civil service commission was still active during Turing's childhood...

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

Non-deterministic Turing machine Post–Turing machine Probabilistic Turing machine Quantum Turing machine Read-only right moving Turing machines Read-only Turing machine...

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

In computability theory, the Turing jump or Turing jump operator, named for Alan Turing, is an operation that assigns to each decision problem X a successively...

1936, Post developed, independently of Alan Turing, a mathematical model of computation that was essentially equivalent to the Turing machine model....

basic machine B is an extremely simple computational model equivalent to the Turing machine. It is "the first formulation of a Turing-machine theory...