Skip to main content

Church–Turing thesis

Church–Turing thesis The proposition that the set of functions on the natural numbers that can be defined by algorithms is precisely the set of functions definable in one of a number of equivalent models of computation. These models include Post production systems, Church's lambda calculus, Turing machines, Kleene's mu-recursion schemes, Herbrand–Gödel equational definability, Shepherdson–Sturgis register machines, the while programming language, and flow charts. The proposition is a scientific hypothesis, subject to empirical and theoretical confirmation rather than mathematical proof. The evidence that it is true is roughly the following.

First, a large number of disparate methods (e.g. those listed above) for computing functions have been shown to be equivalent in power when computing on the natural numbers. Second, there has been a failure to find a function and a convincing method of computing it that has not been computable by one of the known models of computation. Third, philosophically distinct notions – mechanical computability, digital and analog computability, definability in a formal calculus, definability in an algorithmic language – have been investigated and interrelated. Fourth, a generalization of the theory of computable functions to an abstract computability theory for algebras has revealed new connections and distinctions between models, but confirmed the primary nature of the features of the computation theory on the natural numbers.

The Church–Turing thesis leads to a mathematical theory of digital computation that classifies what data can be represented, what processes simulated, and what functions computed (see computable algebra). It provides a scientific foundation for a discussion of the scope and limits of computable processes in the physical and biological sciences, and hence attracts the attention of philosophers, scientists, and engineers.

Cite this article
Pick a style below, and copy the text for your bibliography.

  • MLA
  • Chicago
  • APA

"Church–Turing thesis." A Dictionary of Computing. . 20 Mar. 2019 <>.

"Church–Turing thesis." A Dictionary of Computing. . (March 20, 2019).

"Church–Turing thesis." A Dictionary of Computing. . Retrieved March 20, 2019 from

Learn more about citation styles

Citation styles gives you the ability to cite reference entries and articles according to common styles from the Modern Language Association (MLA), The Chicago Manual of Style, and the American Psychological Association (APA).

Within the “Cite this article” tool, pick a style to see how all available information looks when formatted according to that style. Then, copy and paste the text into your bibliography or works cited list.

Because each style has its own formatting nuances that evolve over time and not all information is available for every reference entry or article, cannot guarantee each citation it generates. Therefore, it’s best to use citations as a starting point before checking the style against your school or publication’s requirements and the most-recent information available at these sites:

Modern Language Association

The Chicago Manual of Style

American Psychological Association

  • Most online reference entries and articles do not have page numbers. Therefore, that information is unavailable for most content. However, the date of retrieval is often important. Refer to each style’s convention regarding the best way to format page numbers and retrieval dates.
  • In addition to the MLA, Chicago, and APA styles, your school, university, publication, or institution may have its own requirements for citations. Therefore, be sure to refer to those guidelines when editing your bibliography or works cited list.