Computability
An Introduction to Recursive Function Theory
by Nigel Cutland
251 pages· 1980· ISBN 9780521294652
About
This introduction to recursive theory computability begins with a mathematical characterization of computable functions, develops the mathematical theory and includes a full discussion of noncomputability and undecidability. Later chapters move on to more advanced topics such as degrees of unsolvability and Gödel's Incompleteness Theorem.
Discuss Computability with other readers
Join or start a book club for Computability on Readfeed. Live chat, shared reading progress, and AI discussion questions — free to get started.
Frequently asked questions
How do I join a book club for Computability?
Sign up free on Readfeed, then browse public clubs or start your own club with Computability as the current read. Invite friends with a share link and discuss together with live chat and AI discussion questions.
Can I discuss Computability with other readers online?
Yes. Readfeed book clubs let you chat live, share progress, and join discussions about Computability with readers worldwide — whether your club is virtual, in-person, or hybrid.
Is Readfeed free?
Yes. Creating an account and joining book clubs is free. Sign up to find readers who love the same books and start discussing today.