Category:Theory of computation
From Wikipedia, the free encyclopedia
The main article for this category is 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.
Wikimedia Commons has media related to Theory of computation.