Category:Theory of computation
|Wikimedia Commons has media related to Computer science.|
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 8 subcategories, out of 8 total.
The following 98 pages are in this category, out of 98 total. This list may not reflect recent changes (learn more).