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

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

computed by a Turing machine. Hypercomputers compute functions that a Turing machine cannot and which are, hence, not computable in the Church–Turing sense....

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

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

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

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

Alan Turing Year The Annotated Turing Church–Turing thesis Church–Turing–Deutsch principle Good–Turing frequency estimation Object-Oriented Turing (programming...

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

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

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

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

argues that super-recursive algorithms can be used to disprove the Church–Turing thesis. This point of view has been criticized within the mathematical...

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

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

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

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

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

and the Church–Turing Thesis (the hypothesis of "every"). The notion of separating out Church's and Turing's theses from the "Church–Turing thesis" appears...

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

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

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

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

what is now known as the Turing test to the general public. Turing's paper considers the question "Can machines think?" Turing says that since the words...

understanding the argument, including symbol processing, Turing machines, Turing completeness, and the Turing test. Searle's arguments are not usually considered...

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