Computability and Unsolvability
by Martin Davis
On This Page
Description
Classic text considers general 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.Tags
Recommendations
Member Reviews
Members
- Recently Added By
Author Information
9+ Works 774 Members
Martin Davis, a professor emeritus at New York University's Courant Institute of Mathematical Sciences and a frequent lecturer, is currently a visiting scholar at the University of California in Berkeley.
Series
Belongs to Publisher Series
Common Knowledge
- Canonical title
- Computability and Unsolvability
Classifications
Statistics
- Members
- 194
- Popularity
- 169,704
- Reviews
- 1
- Rating
- (3.75)
- Languages
- English
- Media
- Paper, Ebook
- ISBNs
- 3
- UPCs
- 1
- ASINs
- 3
