Paperback (01 Feb 2004)
Save $1.86
Includes delivery to the United States
10+ copies available online - Usually dispatched within 7 days
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 |
| Publisher: | Dover Publications Inc. |
| Imprint: | Dover Publications |
| Pub date: | 01 Feb 2004 |
| DEWEY: | 511.3 |
| DEWEY edition: | 22 |
| Language: | English |
| Number of pages: | 413 |
| Weight: | 546g |
| Height: | 232mm |
| Width: | 158mm |
| Spine width: | 22mm |
$9.53off
Paperback
Published 16 Sep 1976
Save $9.53
