Theoretical computer science
subfield of computer science and mathematics From Wikipedia, the free encyclopedia
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
Wikiwand - on
Seamless Wikipedia browsing. On steroids.