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.
Subcategories
This category has the following 8 subcategories, out of 8 total.
Next items are not visible in browsers without Javascript
Next items are not visible in browsers without Javascript
Pages in category "Theory of computation"
The following 90 pages are in this category, out of 90 total.
Next items are not visible in browsers without Javascript
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
I
P
R
S
T
Next items are not visible in browsers without Javascript
This category content has been reduced to only pages contained in the ZIM file.