computability theory, a decider is a Turing machine that halts for every input. A decider is also called a total Turing machine as it represents a total...

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

Maher: The Decider, a stand-up comedy special Decider (Turing machine), a Turing machine that eventually halts for every input "The Decider", a recurring...

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

Turing machine that decides the formal language. In theoretical computer science, such always-halting Turing machines are called total Turing machines or...

the halting problem for Turing machines is undecidable: it is not possible to decide algorithmically whether a Turing machine will ever halt. This paper...

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

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

was first obtained by Turing. In his original proof Turing formalized the concept of algorithm by introducing Turing machines. However, the result 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...

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

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

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

Turing test to the general public. Turing's paper considers the question "Can machines think?" Turing says that since the words "think" and "machine"...

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

recursively enumerable (also recognizable, partially decidable, semidecidable, Turing-acceptable or Turing-recognizable) if it is a recursively enumerable...

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

of Busy Beaver Turing machines, a conjecture was proposed in 2012 suggesting that Busy Beaver machines were natural candidates for Turing universality as...

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

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

Description was given by Turing Award winner Stephen Cook. Aside from a Turing machine, other equivalent (see Church–Turing thesis) models of computation...

1965:291) Turing 1937 in (Davis 1967:118) Turing 1937 in (Davis 1967:116) Turing 1937 in (Davis 1967:117) Turing 1937 in (Davis 1967:138) Turing 1937 in...

resource describing the resource of memory space for a deterministic Turing machine. It represents the total amount of memory space that a "normal" physical...

In computer science and mathematical logic the Turing degree (named after Alan Turing) or degree of unsolvability of a set of natural numbers measures...

Turing's proof is a proof by Alan Turing, first published in November 1936 with the title "On Computable Numbers, with an Application to the Entscheidungsproblem"...

including Turing machines General recursive functions Lambda calculus Post machines (Post–Turing machines and tag machines). Register machines Although...

tapes of a logspace Turing machine, the machine also takes a read-only one-way tape filled with random bits. The Turing machine has to halt for every...

the 1983 biography Alan Turing: The Enigma by Andrew Hodges. The film's title quotes the name of the game cryptanalyst Alan Turing proposed for answering...

problem is decidable if there exists an effective method for deriving the correct answer. Zeroth-order logic (propositional logic) is decidable, whereas...

suppose R is a decider for E. We will use this to produce a decider S for H (which we know does not exist). Given input M and w (a Turing machine and some input...