Editing Computer science (section)

====Theory of computation====

{{main|Theory of computation}}

According to Peter Denning, the fundamental question underlying computer science is, "What can be automated?"<ref name=DenningAutomated/> Theory of computation is focused on answering fundamental questions about what can be computed and what amount of resources are required to perform those computations. In an effort to answer the first question, [[computability theory]] examines which computational problems are solvable on various theoretical [[models of computation]]. The second question is addressed by [[computational complexity theory]], which studies the time and space costs associated with different approaches to solving a multitude of computational problems.

The famous [[P = NP?]] problem, one of the [[Millennium Prize Problems]],<ref>[http://www.claymath.org/millennium/P_vs_NP/ Clay Mathematics Institute] P = NP {{webarchive |url=https://web.archive.org/web/20131014194456/http://www.claymath.org/millennium/P_vs_NP/ |date=October 14, 2013 }}</ref> is an open problem in the theory of computation.

{| style="border:1px solid #ccc; text-align:center; margin:auto;" cellspacing="15"
|-
| [[File:DFAexample.svg|130px]]
| [[File:Syntax tree.svg|96px]]
| <math>M= \{ X : X \not\in X \}</math>
| [[File:Complexity classes.svg|120px]]
|-
| [[Automata theory]]
| [[Formal language]]s
| [[Computability theory]]
| [[Computational complexity theory]]
|-
| [[File:Interaction Net as Configuration.png|96px]]
| [[File:Blochsphere.svg|96px]]
| [[File:XNOR ANSI Labelled.svg]]
| [[File:Kellerautomat.svg|96px]]
|-
| [[Models of computation]]
| [[Quantum computer|Quantum computing theory]]
| [[Circuit (computer science)|Logic circuit theory]]
| [[Cellular automata]]
|}