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 Gödel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. 1965 edition.
Paperback, 416 pages
Published February 18th 2004 by Dover Publications
To see what your friends thought of this book, please sign up.
(showing 1-25 of 25)