|Wikimedia Commons has media related to Computer science.|
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.
This category has the following 9 subcategories, out of 9 total.
Pages in category "Computability theory"
The following 98 pages are in this category, out of 98 total. This list may not reflect recent changes (learn more).
- Chain rule for Kolmogorov complexity
- Church–Turing thesis
- Church–Turing–Deutsch principle
- Circuit satisfiability problem
- Complete numbering
- Computability logic
- Computable analysis
- Computable function
- Computable isomorphism
- Computable number
- Computation in the limit
- Computational theology
- Course-of-values recursion
- Craig's theorem
- Creative and productive sets