The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems, and Computable Functions

by Martin D. Davis

Book Overview

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.

• Format: Paperback
• Language: English
• ISBN: 0486432289
• ISBN13: 9780486432281
• Release Date: February 2004
• Publisher: Dover Publications
• Length: 413 Pages
• Weight: 1.20 lbs.
• Dimensions: 0.8" x 6.4" x 9.2"