Category:Theory of computation
|Wikimedia Commons has media related to Theory of computation.|
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.
This category has the following 9 subcategories, out of 9 total.
- ► Algorithmic information theory (21 P)
- ► Hypercomputation (6 P)
- ► Models of computation (17 C, 116 P)
- ► Theorems in theory of computation (1 C, 4 P)
Pages in category "Theory of computation"
The following 93 pages are in this category, out of 93 total. This list may not reflect recent changes (learn more).
- Chain rule for Kolmogorov complexity
- Chaitin's constant
- Church–Turing thesis
- Church–Turing–Deutsch principle
- Circuit (computer science)
- Communicating X-Machine
- Computable function
- Computable number
- Computation history
- Computation in the limit
- Computational semiotics
- Cylindric numbering