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

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

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

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

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

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

was first obtained by Turing. In his original proof Turing formalized the concept of algorithm by introducing Turing machines. However, the result is...

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

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

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

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

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 test to the general public. Turing's paper considers the question "Can machines think?" Turing says that since the words "think" and "machine"...

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

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

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

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

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

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

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

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

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

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

are not. According to the Church–Turing thesis, any effectively calculable function is calculable by a Turing machine, and thus a set S is computably enumerable...

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

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

calculability" based on his λ-calculus, and by Alan Turing the next year with his concept of Turing machines. Turing immediately recognized that these are equivalent...

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