Description
Book SynopsisTrade ReviewThis is only a 200 page book, but it covers a wealth of material...[A] clear, concise introduction that would be ideal for a one-term undergraduate course...Recommended." -
CHOICE"This short text does an excellent job of covering those topics that should be included in an undergraduate introduction to computability theory... There are both appropriate exercises and enticing doorways to open topics and current research. The exposition is precise, but still conversational. I believe my students will enjoy reading this text." - Jeffry L. Hirst,
Zentralblatt MATHTable of Contents
- Introduction
- Background
- Defining computability
- Working with computable functions
- Computing and enumerating sets
- Turing reduction and Post’s problem
- Two hierarchies of sets
- Further tools and results
- Areas of research
- Mathematical asides
- Bibliography
- Index
