computability theory
Sign in to saveAlso known as recursion theory
study of computable functions and Turing degrees
~36 min read
Encyclopedic overview
Computability theory, also known as recursion theory, is a branch of mathematical logic, computer science, and the theory of computation that originated in the 1930s with the study of computable functions and Turing degrees. The field has since expanded to include the study of generalized computability and definability. In these areas, computability theory overlaps with proof theory and effective descriptive set theory.
Basic questions addressed by computability theory include:
Excerpted from Wikipedia’s “computability theory” article, available under the CC BY-SA 4.0 licence.