computability theory
Sign in to saveAlso known as recursion theory
study of computable functions and Turing degrees
In the Vinony graph
Within Vinony's link graph, computability theory is referenced by 741 other articles, and connects out to recursively enumerable set, Gödel's incompleteness theorems and arithmetical hierarchy.
It sits within the topics Computability theory and Mathematical logic.
Its subject is documented across 42 Wikipedia language editions.
Wikidata facts
- Subclass of
- theory of computation
Show 3 more facts
- topic's main category
- Category:Computability theory
- Commons category
- Computer science
- on focus list of Wikimedia project
- Wikipedia:Vital articles/Level/4
Sources (2)
via Wikidata · CC0
~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.