The undecidable : basic papers on undecidable propositions, unsolvable problems and computable functions
An anthology of fundamental papers on undecidability and unsolvability, this classic reference opens with Gödel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by Goèdel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. --from publisher description
Print Book, English, 2004
Dover Publications, Mineola, N.Y., 2004