Theoretical Computer Science is a division
or subset of general computer science and mathematics that focuses on more
abstract or mathematical aspects of computing and includes the theory of computation. Theoretical Computer Science has many topics, which include algorithms, data structures, computational complexity theory, distributed computation, parallel computation, very-large-scale integration, machine learning, etc.
Theoretical Computer Science aims to
understand the intrinsic capabilities and limitations of efficient computation.
This subfield of computer science has a record of producing unexpected
discoveries of high impact — such as public-key cryptography and quantum
computation — and of raising deep scientific questions, such as the P vs. NP
question.
One interesting thing is that the
"theory people" in computer science self-identify as different from
the "applied people." Some characterize themselves as doing the
"(more fundamental) 'science' underlying the field of computing."
Other "theory-applied people" suggest that it is impossible to
separate theory and application. This means that the so-called "theory
people" regularly use experimental science done in less-theoretical areas
such as software system research. It also means that there is more cooperation
than mutually exclusive competition between theory and application.
---------------------------------------------------------------------------------
Writing References:
1.https://en.wikipedia.org/wiki/Theoretical_computer_science
2.http://archive2.cra.org/ccc/visioning/visioning-activities/theoretical-computer-science
Picture References:
1.http://archive2.cra.org/ccc/files/images/activities/theory.jpg
2.https://upload.wikimedia.org/wikipedia/commons/3/3d/Maquina.png


No comments:
Post a Comment