| |
| |
Theoretical computer science - Wikipedia, the free encyclopedia |
 | | Theoretical computer science is the collection of topics of computer science that focuses on the more abstract and mathematical aspects of computing, such as the theory of computation, analysis of algorithms and semantics of programming languages. |
 | | "The field of theoretical computer science is interpreted broadly so as to include algorithms, data structures, computational complexity theory, distributed computation, parallel computation, VLSI, machine learning, computational biology, computational geometry, information theory, cryptography, quantum computation, computational number theory and algebra, program semantics and verification, automata theory, and the study of randomness. |
 | | Some characterize themselves as doing the "'science' underlying the field of computing"[1], although this neglects the experimental science done in non-theoretical areas such as software system research. |
| en.wikipedia.org /wiki/Theoretical_computer_science (293 words) |
|