Computability and Unsolvability

Computability and Unsolvability

Martin D. Davis

3.84

32 ratings 2 reviews

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.

Genres: Computer ScienceReferenceMathematicsSciencePhilosophy

248 Pages

Community Reviews:

5 star

9 (28%)

4 star

12 (38%)

3 star

8 (25%)

2 star

3 (9%)

1 star

0 (0%)

Readers also enjoyed

All similar books

Other books by Martin D. Davis

The Universal Computer: The Road from Leibniz to Turing

The Universal Computer: The Road from Leibniz to Turing Martin D. Davis

4.11

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science

Computability, Complexity, and Languages: Fundamentals of Theoretical Computer Science Martin D. Davis

4.06

Computability and Unsolvability

Computability and Unsolvability Martin D. Davis

3.84

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

The Undecidable: Basic Papers on Undecidable Propositions, Unsolvable Problems and Computable Functions Martin D. Davis

4.19

All books by this author

Lists with this book

Introduction to Algorithms

Structure and Interpretation of Computer Programs

The C Programming Language

Essential Books of Computer Science

200 books • 307 voters

Category Theory in Context

On Formally Undecidable Propositions of Principia Mathematica and Related Systems

A Book of Abstract Algebra

Dover Mathematics

891 books • 37 voters

All lists with this book