Page "Computability theory" Paragraph 5

These results led Stephen Kleene ( 1952 ) to coin the two names " Church's thesis " ( Kleene 1952: 300 ) and " Turing's Thesis " ( p. 376 ).

Nowadays these are often considered as a single hypothesis, the Church – Turing thesis, which states that any function that is computable by an algorithm is a computable function.

Although initially skeptical, by 1946 Gödel argued in favor of this thesis: