Best of
Logic
1965
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
Martin D. Davis - 1965
Subsequent papers by Gödel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. 1965 edition.