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

(ed.)
Dover Publication (1965)

Abstract
"A valuable collection both for original source material as well as historical formulations of current problems."-- The Review of Metaphysics "Much more than a mere collection of papers . . . a valuable addition to the literature."-- Mathematics of Computation An anthology of fundamental papers on undecidability and unsolvability by major figures in the field, this classic reference opens with Godel's landmark 1931 paper demonstrating that systems of logic cannot admit proofs of all true assertions of arithmetic. Subsequent papers by Godel, Church, Turing, and Post single out the class of recursive functions as computable by finite algorithms. Additional papers by Church, Turing, and Post cover unsolvable problems from the theory of abstract computing machines, mathematical logic, and algebra, and material by Kleene and Post includes initiation of the classification theory of unsolvable problems. Suitable for graduate and undergraduate courses. 1965 ed.
Keywords Gödel's theorem  Unsolvability (Mathematical logic  Recursive functions  Turing machines  Computable functions
Categories (categorize this paper)
Reprint years 2004
Buy the book $11.68 new (54% off)   $14.00 used (44% off)   $20.04 direct from Amazon (20% off)    Amazon page
Call number QA9.65.U53 2004
ISBN(s) 0486432289   9780486432281
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

Our Archive


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 45,545
External links

Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
Through your library
Chapters BETA

References found in this work BETA

No references found.

Add more references

Citations of this work BETA

How Are Grammers Represented?Edward P. Stabler - 1983 - Behavioral and Brain Sciences 6 (3):391.
Alan Turing and the Mathematical Objection.Gualtiero Piccinini - 2003 - Minds and Machines 13 (1):23-48.
Computationalism in the Philosophy of Mind.Gualtiero Piccinini - 2009 - Philosophy Compass 4 (3):515-532.

View all 64 citations / Add more citations

Similar books and articles

Generalized Weak Presentations.Alexandra Shlapentokh - 2002 - Journal of Symbolic Logic 67 (2):787-819.
Degrees of Unsolvability of Continuous Functions.Joseph S. Miller - 2004 - Journal of Symbolic Logic 69 (2):555 - 584.
Two Dogmas of Computationalism.Oron Shagrir - 1997 - Minds and Machines 7 (3):321-44.
Computability and Recursion.Robert I. Soare - 1996 - Bulletin of Symbolic Logic 2 (3):284-321.
Computability & Unsolvability.Martin Davis - 1958 - Dover Publications.

Analytics

Added to PP index
2009-01-28

Total views
115 ( #72,298 of 2,280,396 )

Recent downloads (6 months)
6 ( #188,466 of 2,280,396 )

How can I increase my downloads?

Downloads

My notes

Sign in to use this feature