Category:Computability theory
Jump to navigation
Jump to search
 |
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.
Related information about computability theory in computer science is described in the theory of computation article and is categorized in Category:Theory of computation
Subcategories
This category has the following 10 subcategories, out of 10 total.
C
E
H
L
R
T
U
Pages in category "Computability theory"
The following 96 pages are in this category, out of 96 total. This list may not reflect recent changes (learn more).
A
C
- Chain rule for Kolmogorov complexity
- Church–Turing thesis
- Church–Turing–Deutsch principle
- Circuit satisfiability problem
- Complete numbering
- Computability logic
- Computable analysis
- Computable function
- Computable number
- Computation
- Computation in the limit
- Course-of-values recursion
- Craig's theorem
- Creative and productive sets
