Church’s thesis

An algorithm or mechanical procedure A is said to ‘compute’ a function f if, for any n in the domain of f, when given n as input, A eventually produces fn as output. A function is ‘computable’ if there is an algorithm that computes it. A set S is ‘decidable’ if there is an algorithm that decides membership in S: if, given any appropriate n as input, the algorithm would output ‘yes’ if n∈S, and ‘no’ if $n\notin S$ . The notions of ‘algorithm’, ‘computable’ and ‘decidable’ are informal (or pre-formal) in that they have meaning independently of, and prior to, attempts at rigorous formulation.

Church’s thesis, first proposed by Alonzo Church in a paper published in 1936, is the assertion that a function is computable if and only if it is recursive: ‘We now define the notion…of an effectively calculable function…by identifying it with the notion of a recursive function….’ Independently, Alan Turing argued that a function is computable if and only if there is a Turing machine that computes it; and he showed that a function is Turing-computable if and only if it is recursive.

Church’s thesis is widely accepted today. Since an algorithm can be ‘read off’ a recursive derivation, every recursive function is computable. Three types of ‘evidence’ have been cited for the converse. First, every algorithm that has been examined has been shown to compute a recursive function. Second, Turing, Church and others provided analyses of the moves available to a person following a mechanical procedure, arguing that everything can be simulated by a Turing machine, a recursive derivation, and so on. The third consideration is ‘confluence’. Several different characterizations, developed more or less independently, have been shown to be coextensive, suggesting that all of them are on target. The list includes recursiveness, Turing computability, Herbrand–Gödel derivability, λ-definability and Markov algorithm computability.