A copy of this work was available on the public web and has been preserved in the Wayback Machine. The capture dates from 2011; you can also visit the original URL.
The file type is application/pdf.
Church's Thesis and Functional Programming
[chapter]
Church's Thesis After 70 Years
Preserved Fulltext
We now define the notion, already discussed, of an effectively calculable function of positive integers by identifying it with the notion of a recursive function of positive integers (or of a lambdadefinable function of positive integers).
doi:10.1515/9783110325461.518
fatcat:vbtqpixre5fxfdvz2j4k3jfnlu