Computability & Unsolvability

Dover (1958)
Abstract
Classic text considersgeneral theory of computability, computable functions, operations on computable functions, Turing machines self-applied, unsolvable decision problems, applications of general theory, mathematical logic, Kleene hierarchy, computable functionals, classification of unsolvable decision problems and more.
Keywords Recursive functions  Unsolvability (Mathematical logic  Computable functions
Categories (categorize this paper)
Buy the book $5.22 new (70% off)   $14.28 direct from Amazon (16% off)    Amazon page
Call number QA9.615.D38 1982
ISBN(s) 0486614719   9780486614717
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,316
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
Stewart Shapiro (1980). On the Notion of Effectiveness. History and Philosophy of Logic 1 (1-2):209-230.

View all 63 citations

Similar books and articles
Analytics

Monthly downloads

Added to index

2009-01-28

Total downloads

40 ( #40,143 of 1,096,453 )

Recent downloads (6 months)

3 ( #90,211 of 1,096,453 )

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.