Category:Theory of computation

From Wikipedia, the free encyclopedia
Jump to navigation Jump to search

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.

C

H

L

M

Pages in category "Theory of computation"

The following 94 pages are in this category, out of 94 total. This list may not reflect recent changes (learn more).