## Theoretical computer science |

**Theoretical computer science** (**TCS**) is a subset of general

It is difficult to circumscribe the theoretical areas precisely. The ^{[1]}

TCS covers a wide variety of topics including

algorithms ,data structures ,computational complexity ,parallel anddistributed computation,probabilistic computation ,quantum computation ,automata theory ,information theory ,cryptography ,program semantics andverification ,machine learning ,computational biology ,computational economics ,computational geometry , andcomputational number theory andalgebra . Work in this field is often distinguished by its emphasis on mathematical technique andrigor .

- history
- topics
- organizations
- journals and newsletters
- conferences
- see also
- notes
- further reading
- external links

While logical inference and mathematical proof had existed previously, in 1931

These developments have led to the modern study of logic and ^{[citation needed]}. ^{[citation needed]}.

With the development of ^{[citation needed]}

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: