Category:Theory of computation
From HandWiki
Here is a list of articles in the Theory of computation category of the Computing portal that unifies foundations of mathematics and computations using computers. 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 7 subcategories, out of 7 total.
Pages in category "Theory of computation"
The following 101 pages are in this category, out of 101 total.
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 isomorphism
- Computable number
- Computable set
- Computably enumerable
- Computably enumerable set
- Computation history
- Computation in the limit
- Computational semiotics
- Cylindric numbering
- Cylindrification
