Category:Computability theory
From Wikipedia, the free encyclopedia
This category is for articles about computability theory, also known as recursion theory, a branch of mathematical logic and computer science concerned with generalizations of the notion of computable function, and with related concepts such as Turing degrees.
Wikimedia Commons has media related to Computability theory.
The main article for this category is Computability theory.
Related information about computability theory in computer science is described in the theory of computation article and is categorized in Category:Theory of computation.