Open main menu
Home
Random
Recent changes
Special pages
Community portal
Preferences
About Wikipedia
Disclaimers
Incubator escapee wiki
Search
User menu
Talk
Dark mode
Contributions
Create account
Log in
Editing
Theoretical computer science
(section)
Warning:
You are not logged in. Your IP address will be publicly visible if you make any edits. If you
log in
or
create an account
, your edits will be attributed to your username, along with other benefits.
Anti-spam check. Do
not
fill this in!
== History == {{Main|History of computer science}} While logical inference and mathematical proof had existed previously, in 1931 [[Kurt GΓΆdel]] proved with his [[incompleteness theorem]] that there are fundamental limitations on what statements could be proved or disproved. [[Information theory]] was added to the field with [[A Mathematical Theory of Communication|a 1948 mathematical theory of communication]] by [[Claude Shannon]]. In the same decade, [[Donald Hebb]] introduced a mathematical model of [[Hebbian learning|learning]] in the brain. With mounting biological data supporting this hypothesis with some modification, the fields of [[neural network]]s and [[parallel distributed processing]] were established. In 1971, [[Stephen Cook]] and, working [[Multiple discovery|independently]], [[Leonid Levin]], proved that there exist practically relevant problems that are [[NP-complete]] β a landmark result in [[computational complexity theory]].<ref>{{cite book |doi=10.1145/800157.805047 |chapter=The complexity of theorem-proving procedures |title=Proceedings of the third annual ACM symposium on Theory of computing - STOC '71 |date=1971 |last1=Cook |first1=Stephen A. |pages=151β158 |isbn=978-1-4503-7464-4 }}</ref> Modern theoretical computer science research is based on these basic developments, but includes many other mathematical and interdisciplinary problems that have been posed, as shown below: {| style="border:1px solid #ddd; text-align:center; margin: 0 auto;" cellspacing="15" | <math> P \rightarrow Q \,</math> | [[File:DFAexample.svg|96px]] | [[File:Elliptic curve simple.svg|96px]] | [[File:6n-graf.svg|96px]] | [[File:Wang tiles.svg|96px]] | '''P = NP''' ? |- | [[Mathematical logic]] | [[Automata theory]] | [[Number theory]] | [[Graph theory]] | [[Computability theory]] | [[Computational complexity theory]] |- | '''GNITIRW-TERCES''' | <math>\Gamma\vdash x: \text{Int}</math> | [[File:Commutative diagram for morphism.svg|96px]] | [[File:SimplexRangeSearching.svg|96px]] | [[File:TSP Deutschland 3.png|96px]] | [[File:Blochsphere.svg|96px]] |- | [[Cryptography]] | [[Type theory]] | [[Category theory]] | [[Computational geometry]] | [[Combinatorial optimization]] | [[Quantum computer|Quantum computing theory]] |}
Edit summary
(Briefly describe your changes)
By publishing changes, you agree to the
Terms of Use
, and you irrevocably agree to release your contribution under the
CC BY-SA 4.0 License
and the
GFDL
. You agree that a hyperlink or URL is sufficient attribution under the Creative Commons license.
Cancel
Editing help
(opens in new window)