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

needed] The Church–Turing thesis conjectures that any function whose values can be computed by an algorithm can be computed by a Turing machine, and...

introduced by Alonzo Church. Church's work intertwined with Turing's to form the basis for the Church–Turing thesis. This thesis states that Turing machines, lambda...

Quantum Computers: the Church-Turing Hypothesis Versus the Turing Principle in Christof Teuscher, Douglas Hofstadter (eds.) Alan Turing: life and legacy of...

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

work, Turing enrolled at Princeton later that year under Church for a Ph.D. Church and Turing then showed that the lambda calculus and the Turing machine...

algorithm and computation with the Turing machine, which can be considered a model of a general-purpose computer. Turing is widely considered to be the father...

including Turing machines μ-recursive functions Lambda calculus Post machines (Post–Turing machines and tag machines). Register machines Although these models...

Statue of Alan Turing, Bletchley Park, England Alan Turing: The Enigma Alan Turing Year The Annotated Turing Church–Turing thesis Church–Turing–Deutsch principle...

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

particular quantum Turing machine. However, the computationally equivalent quantum circuit is a more common model.: 2  Quantum Turing machines can be related...

Alan Turing Institute Church–Turing thesis Good–Turing frequency estimation Turing completeness Turing degree Turing fixed-point combinator Turing Institute...

one set to another even when a Turing reduction for the same sets exists. According to the Church–Turing thesis, a Turing reduction is the most general...

models in use, but the most commonly examined is the Turing machine. Computer scientists study the Turing machine because it is simple to formulate, can be...

The history of the Church–Turing thesis ("thesis") involves the history of the development of the study of the nature of functions whose values are effectively...

functions under Church encoding. The Church–Turing thesis asserts that any computable operator (and its operands) can be represented under Church encoding.[dubious...

functions calculated by a person with paper and pencil, and (2) the Turing machine or its Turing equivalents—the primitive register-machine or "counter-machine"...

problem considered in Turing's 1936 paper ("does a Turing machine starting from a blank tape ever print a given symbol?"). However, Turing equivalence is rather...

epistemological issues that concern it. Some of these questions may include: What is computation? Does the Church–Turing thesis capture the mathematical notion...

of its input increases. Per the Church–Turing thesis, any algorithm can be computed by any Turing complete model. Turing completeness only requires four...

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

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

Alonzo Church in 1935 with the concept of "effective calculability" based on his λ-calculus, and by Alan Turing the next year with his concept of Turing machines...

Alonzo Church, Rózsa Péter, Alan Turing, Stephen Kleene, and Emil Post. The fundamental results the researchers obtained established Turing computability...

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

could be described "purely mechanical." The theoretical Turing Machine, created by Alan Turing, is a hypothetical device theorized in order to study the...

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

GPAC is equivalent, in computability terms, to Turing machines, thereby proving the physical Church–Turing thesis for the class of systems modelled by the...

falsification. Alan Turing's theory of computation, especially as developed in Deutsch's Turing principle, in which the Universal Turing machine is replaced...

enumerable or Turing-recognizable languages. Note that this is different from the recursive languages, which can be decided by an always-halting Turing machine...