from: Dover Publications
Regular marked price: $24.95Discount Price: $16.47
Cost Savings: $8.48 (34%)Price fluctuation possible.
How soon does it ship: Normal ship time within one day
Shipping? Absolutely FREE if you qualify for Super Saver Shipping.
Type of bind: Paperback
Dewey Decimal Number: 511.3
EAN num: 9780486432281
ISBN number: 0486432289
Label: Dover Publications
Manufacturer: Dover Publications
Quantity: 1
Page Count: 416
Printing Date: February 18, 2004
Publishing house: Dover Publications
Sale Popularity Level: 217643
Studio: Dover Publications
Other books you might be interested in perusing:
Editor's Notes and Comments:
Product Description:
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.
User popularity level:
Rated by buyers -
This is a great collection of seminal papers by Goedel, Church, Turing, Rosser, Kleene, and Post on the topic of undecidability. It is an extremely handy reference.
Just to note: this is certainly not a tutorial or guide to this topic for the beginner. Davis provides some prefatory comments, but these are concise and mostly set the context for the papers, rather than explaining the content of the papers. This book is more for someone interested in going back to very first sources.
Find other books like this one:
