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)
Buy the book $10.95 used (57% off)   $12.73 new (49% off)   $17.27 direct from Amazon (31% off)    Amazon page
Call number QA9.65.U53 2004
ISBN(s) 0486432289   9780486432281
Options
 Save to my reading list
Follow the author(s)
My bibliography
Export citation
Find it on Scholar
Edit this record
Mark as duplicate
Revision history Request removal from index
 
Download options
PhilPapers Archive


Upload a copy of this paper     Check publisher's policy on self-archival     Papers currently archived: 9,360
External links
  •   Try with proxy.
  • Through your library Configure
    References found in this work BETA

    No references found.

    Citations of this work BETA
    Stewart Shapiro (1980). On the Notion of Effectiveness. History and Philosophy of Logic 1 (1-2):209-230.
    Stewart Shapiro (1983). Remarks on the Development of Computability. History and Philosophy of Logic 4 (1-2):203-220.

    View all 25 citations

    Similar books and articles
    Analytics

    Monthly downloads

    Added to index

    2009-01-28

    Total downloads

    67 ( #17,909 of 1,088,810 )

    Recent downloads (6 months)

    5 ( #20,067 of 1,088,810 )

    How can I increase my downloads?

    My notes
    Sign in to use this feature


    Discussion
    Start a new thread
    Order:
    There  are no threads in this forum
    Nothing in this forum yet.