Jump to content

Category:Theory of computation

From Wikipedia, the free encyclopedia

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.

Pages in category "Theory of computation"

The following 92 pages are in this category, out of 92 total. This list may not reflect recent changes.