Page "Church–Turing thesis" Paragraph 30

:" This heuristic fact recursive functions are effectively calculable ... led Church to state the following thesis (< sup > 22 </ sup >).

The same thesis is implicit in Turing's description of computing machines (< sup > 23 </ sup >).