Computability Theory: An Introduction to Recursion Theory

Academic Press (2011)
Abstract
Machine generated contents note: 1. The Computability Concept;2. General Recursive Functions;3. Programs and Machines;4. Recursive Enumerability;5. Connections to Logic;6. Degrees of Unsolvability;7. Polynomial-Time Computability;Appendix: Mathspeak;Appendix: Countability;Appendix: Decadic Notation;.
Keywords Recursion theory
Categories (categorize this paper)
Buy the book $32.72 used (60% off)   $41.82 new (48% off)   $68.92 direct from Amazon (14% off)    Amazon page
Call number QA9.6.E53 2011
ISBN(s) 9780123849588   0123849586
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: 10,337
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
References found in this work BETA

No references found.

Citations of this work BETA

No citations found.

Similar books and articles
Robert I. Soare (1996). Computability and Recursion. Bulletin of Symbolic Logic 2 (3):284-321.
Stewart Shapiro (1983). Remarks on the Development of Computability. History and Philosophy of Logic 4 (1-2):203-220.
Analytics

Monthly downloads

Added to index

2010-10-21

Total downloads

10 ( #140,553 of 1,096,595 )

Recent downloads (6 months)

1 ( #258,571 of 1,096,595 )

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.