The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions Davis MartinPaperback
A valuable collection both for original source material as well as historical formulations of current problems. -- The Review of MetaphysicsMuch more than a mere collection of papers. A valuable…
Specifikacia The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions Davis MartinPaperback
A valuable collection both for original source material as well as historical formulations of current problems. -- The Review of MetaphysicsMuch more than a mere collection of papers. A valuable addition to the literature. -- Mathematics of ComputationAn anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference is ideally suited as a text for graduate and undergraduate courses in logic, philosophy, and foundations of mathematics. It is also appropriate for self-study.The text opens with Godel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by Godel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. Additional papers by Church, Turing, and Post cover