In theoretical computer science, the theory of computation is the branch that deals with whether and how efficiently problems can be solved on a model of computation, using an algorithm. The field is divided into three major branches: automata theory, computability theory and computational complexity theory.
Subcategories
This category has the following 8 subcategories, out of 8 total.
A
- Algorithmic information theory (22 P)
C
H
- Hypercomputation (6 P)
L
- Limits of computation (12 P)
M
T
Pages in category "Theory of computation"
The following 92 pages are in this category, out of 92 total. This list may not reflect recent changes.
B
C
- Chain rule for Kolmogorov complexity
- Chaitin's constant
- Church–Turing thesis
- Church–Turing–Deutsch principle
- Circuit (computer science)
- Communicating X-Machine
- List of computability and complexity topics
- Computable function
- Computable number
- Computable set
- Computably enumerable set
- Computation history
- Computation in the limit
- Computational semiotics
- Cylindric numbering
- Cylindrification