Jump to navigation Jump to search
branch of mathematical logic, computer science, and the theory of computation studying computable functions and Turing degrees
|Subclass of||mathematical logic,|
theoretical computer science,
theory of computation
English: This category is for articles about recursion theory, also called computability theory, which is 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. Related information about computability theory in computer science is described in the theory of computation article and is categorized in Category:Theory of computation.
This category has the following 3 subcategories, out of 3 total.