Category:Computability theory
Wikimedia Commons has media related to Computability theory.
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.
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
- Computability theorists (13 P)
- Computable analysis (9 P)
E
H
- Hypercomputation (6 P)
L
R
- Reduction (complexity) (17 P)
T
- Turing machine (31 P)
U
- Undecidable problems (22 P)
Pages in category "Computability theory"
The following 100 pages are in this category, out of 100 total. This list may not reflect recent changes.
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
- Computable ordinal
- Computable set
- Computably enumerable set
- Computably inseparable
- Computation
- Computation in the limit
- Course-of-values recursion
- Craig's theorem
- Creative and productive sets