Site Navigation
Categories:
Recursion theory
Alan Turing
Theory of computation

Summary Of: Church-Turing thesis

the Church-Turing thesis has often been misinterpreted as a claim that real computers can be modeled as Turing... The Church-Turing thesis concerns the computability of mathematical functions... the Church-Turing thesis asserts that this function cannot be effectively computed by any method... This interpretation of the Church-Turing thesis differs from the interpretation commonly accepted in computability theory... are indeed algorithms in the sense of the Church-Turing thesis has not found broad acceptance within the computability research community...

Encyclodia Page On: Church-Turing thesis

These Are Links To Other Documents
Church's thesis (constructive mathematics) | computability theory | hypothesis | effectively calculable | recursion | Turing machine | λ-calculus | Alonzo Church | Stephen Kleene | J.B. Rosser | Alan Turing | Stephen Kleene | Emil Post | inductive reasoning | natural law | Kurt Gödel | algorithm | Turing Machine | Effectively calculable | History of the Church-Turing thesis | David Hilbert's | Entscheidungsproblem | Alonzo Church | Stephen Kleene | λ-definable functions | Kurt Gödel | Kurt Gödel | Herbrand | J. B. Rosser | well formed formula | Alan Turing | Turing machine | formal system | Robin Gandy | lambda calculus | Turing machine | Stephen Kleene | Kurt Gödel | Emil Post | Hao Wang | Martin Davis | Post-Turing machine | Marvin Minsky | Melzak | Lambek | counter machine | register machine | computer | combinatory logic | Markov algorithms | pointer machine | Turing complete | complexity theory | probabilistic Turing machine | BPP | P | quantum computers | BQP | quantum algorithms | probabilistic algorithms | super-recursive algorithm | anytime algorithm | philosophy of mind | hypercomputation | digital physics | hypercomputer | real numbers | computable reals | hypercomputer | quantum mechanical | John Lucas | Roger Penrose | busy beaver | Turing machine | halting problem | super-recursive algorithms | Computability logic | Computability theory | Decidability | Hypercomputer | Super-recursive algorithm | Church's thesis in constructive mathematics | primitive recursion | Rózsa Péter | mu operator | recursion | recursively | λ-definable | inductive reasoning | Andreas Blass | Yuri Gurevich | ISBN 0387955690 | Church, A. | Martin Davis | Robin Gandy | ISBN 3-211-82637-8 | Gödel, K. | Yuri Gurevich | Herbrand, J. | Hofstadter, Douglas R. | Gödel, Escher, Bach: an Eternal Golden Braid | Kleene, S.C. | Kleene C., Stephen | doi | Knuth | Markov, A.A. | A. A. Markov | Springer Verlag | J. B. Rosser | Robert Soare | Stanford Encyclopedia of Philosophy | Categories | Recursion theory | Alan Turing | Theory of computation |
This article is licensed under the GNU Free Documentation License. It uses material from the Wikipedia article "Church-Turing thesis".