Rebecca Weber, Dartmouth College, Hanover, NH, USA

This 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 MATH

• IntroductionBackgroundDefining computabilityWorking with computable functionsComputing and enumerating setsTuring reduction and Post’s problemTwo hierarchies of setsFurther tools and resultsAreas of researchMathematical asidesBibliographyIndex

Rebecca Weber, Dartmouth College, Hanover, NH, USA

This 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 MATH

• IntroductionBackgroundDefining computabilityWorking with computable functionsComputing and enumerating setsTuring reduction and Post’s problemTwo hierarchies of setsFurther tools and resultsAreas of researchMathematical asidesBibliographyIndex

Rebecca Weber, Dartmouth College, Hanover, NH, USA

This 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 MATH

• IntroductionBackgroundDefining computabilityWorking with computable functionsComputing and enumerating setsTuring reduction and Post’s problemTwo hierarchies of setsFurther tools and resultsAreas of researchMathematical asidesBibliographyIndex