746
edits
add info
(add info) |
(add info) |
||
| Line 97: | Line 97: | ||
The famous [[P versus NP problem|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. | The famous [[P versus NP problem|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]] | |||
|} | |||
====Information and coding theory==== | |||
{{main|Information theory|Coding theory}} | |||