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.
| ISBN: | 9780486432281 |
| Publication date: | 1st February 2004 |
| Author: | Martin Davis |
| Publisher: | Dover Publications an imprint of Dover Publications Inc. |
| Format: | Paperback |
| Pagination: | 413 pages |
| Series: | Dover Books on Mathematics |
| Genres: |
Mathematics |
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.
The Undecidable features in the following genres: Mathematics
The Undecidable is available in Paperback
The Undecidable was written by Martin Davis and published by Dover Publications an imprint of Dover Publications Inc.
The Undecidable has 413 pages
Yes it is part of Dover Books on Mathematics series