Goodreads helps you keep track of books you want to read.
Start by marking “The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions” as Want to Read:
The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions
Enlarge cover
Rate this book
Clear rating
Open Preview

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

by
4.0 of 5 stars 4.00  ·  rating details  ·  8 ratings  ·  0 reviews
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.
Paperback, 414 pages
Published February 18th 2004 by Dover Publications
more details... edit details

Friend Reviews

To see what your friends thought of this book, please sign up.

Reader Q&A

To ask other readers questions about The Undecidable, please sign up.

Be the first to ask a question about The Undecidable

This book is not yet featured on Listopia. Add this book to your favorite list »

Community Reviews

(showing 1-30 of 31)
filter  |  sort: default (?)  |  rating details
Renate
Renate marked it as to-read
May 18, 2015
Telorian
Telorian marked it as to-read
Feb 10, 2015
Jur
Jur marked it as to-read
Jan 30, 2015
Andrew
Andrew marked it as to-read
Dec 14, 2013
Alan
Alan marked it as to-read
May 12, 2013
Jonathan Chan
Jonathan Chan marked it as to-read
Apr 02, 2013
Martisch
Martisch marked it as to-read
Feb 03, 2013
William Sipes
William Sipes marked it as to-read
Jan 20, 2013
Stephen
Stephen marked it as to-read
Jun 12, 2012
David Scarratt
David Scarratt marked it as to-read
Jul 26, 2011
Wes
Wes is currently reading it
Oct 03, 2009
Ray
Ray marked it as to-read
Nov 05, 2008
Jason
Jason marked it as to-read
Aug 01, 2008
« previous 1 next »
There are no discussion topics on this book yet. Be the first to start one »
The Universal Computer: The Road from Leibniz to Turing Engines of Logic: Mathematicians & the Origin of the Computer Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science (Computer Science and Scientific Computing) Computability and Unsolvability Applied Nonstandard Analysis

Share This Book