Computability and Unsolvability

Computability and Unsolvability

1958 • 292 pages

Classic graduate-level introduction to theory of computability. Discusses 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, more.

Become a Librarian

Tags


Reviews

Popular Reviews

Reviews with the most likes.

There are no reviews for this book. Add yours and it'll show up right here!