1.Previous
3.Next

and definability. In these areas, computability theory overlaps with proof theory and effective descriptive set theory.

Basic questions addressed by computability theory include:
* What does it mean for a function on the natural numbers to be computable?
* How can noncomputable functions be classified

1.Previous
3.Next