Theoretical computer science

Theoretical computer science is the study of mathematics and computer science related to the theory of computation^[1] and formal methods.^[2] Topics in theoretical computer science are:

• Automata theory^[1][2]
• Category theory^[2]
• Coding theory
• Combinatorial optimization^[3]
• Computability theory^[1][2]
• Computational complexity theory^[1][2]
• Computer algebra
• Cryptography^[4]
• Distributed computing
• Formal languages^[1][2]
• Formal verification^[2]
• Graph theory
• Information theory
• Mathematical logic^[1][2]
• Parallel computing^[2]
• Programming language theory^[2]
• Quantum computation^[5]
• Type theory^[2]

References

1. "Preface". Computability, Complexity, and Languages: xiii–xv. 1983. doi:10.1016/B978-0-12-206380-0.50004-3.
2. Gurevich, Yuri (June 1994). "Logic activities in Europe". ACM SIGACT News. 25 (2): 11–24. doi:10.1145/181462.181464.
3. Combinatorial optimization and theoretical computer science: interfaces and perspectives: 30th anniversary of the LAMSADE. Hoboken, NJ: Wiley. ISBN 9780470611098.
4. Hromkovič, Juraj. Theoretical Computer Science: Introduction to Automata, Computability, Complexity, Algorithmics, Randomization, Communication, and Cryptography (1., st Edition. Softcover version of original hardcover 2011 ed.). Berlin: Springer Berlin. ISBN 978-3-642-05729-8.
5. Yanofsky, Noson S.; Mannucci, Mirco A. (2008). Quantum computing for computer scientists. Cambridge: Cambridge University Press. ISBN 9780511813887.