Computability Theory

Part of the Theory and Applications of Computability book series (THEOAPPLCOM)


In this chapter we will develop a significant amount of computability theory. Much of this technical material will not be needed until much later in the book, and perhaps in only a small section of the book. We have chosen to gather it in one place for ease of reference. However, as a result this chapter is quite uneven in difficulty, and we strongly recommend that one use most of it as a reference for later chapters, rather than reading through all of it in detail before proceeding. This is especially so for those unfamiliar with more advanced techniques such as priority arguments.


Turing Machine Computable Function Computability Theory Peano Arithmetic Turing Degree 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Springer Science+Business Media, LLC 2010

Authors and Affiliations

  1. 1.School of Mathematics, Statistics and Operations ResearchVictoria University of WellingtonWellingtonNew Zealand
  2. 2.Department of MathematicsUniversity of ChicagoChicagoUSA

Personalised recommendations