Category:Computability theory
From HandWiki
Here is a list of articles in the Computability theory category of the Computing portal that unifies foundations of mathematics and computations using computers. 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.
Subcategories
This category has the following 7 subcategories, out of 7 total.
Pages in category "Computability theory"
The following 116 pages are in this category, out of 116 total.
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 isomorphism
- Computable number
- Computable ordinal
- Computable set
- Computably enumerable
- Computably enumerable set
- Computably inseparable
- Computation
- Computation in the limit
- Computational theology
- Course-of-values recursion
- Craig's theorem
- Creative and productive sets
