Category:Theory of computation

From Wikipedia, the free encyclopedia
Jump to: navigation, 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.

A

C

C cont.

H

M

R

T

Pages in category "Theory of computation"

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

 

*

A

B

C

D

E

F

G

H

H cont.

I

L

M

N

O

P

Q

R

R cont.

S

T

U

W

X

Y