What is Theoretical Computer Science?
Theoretical Computer Science is concerned with the theory of computer algorithms. Together Discrete Mathematics and Theoretical Computer Science form powerful tools for solving important problems of science, industry and government. • What is biomathematics? Modern biology has changed dramatically in the past two decades. Driven by large scientific endeavors such as the human genome project, it has become very much an information science, closely tied to tools and methods of the mathematical sciences. New algorithms and mathematical models played a central role in sequencing the human genome and continue to play a crucial role as biology develops models of information processing in biological organisms. Bio-mathematics is concerned with information processing in biology at all levels, from the molecular to the cell to the organ to the organism to the “system.” Bio-mathematics also involves the use of mathematical reasoning to study problems in the spread of disease, growth of populatio
Theoretical computer science is largely an abstract mathematical discipline that seeks to better understand the nature of computation. But like research in physics, advances in theoretical computer science end up providing practical contributions to the field of computing in general. The discipline of theoretical computer science can be divided into several subcategories. The prototypical subcategory of theoretical computer science is the study of abstract complexity, which involves algorithms, automata, complexity, and games. For example, what generalizations can we make about the behavior of certain algorithms as they approach an infinite amount of computing power in the limit? What is the space of possible programs that can be described with less than 50 bits? What statistical methods may be used to determine whether or not a given algorithm or program is performing its task optimally? Another subcategory of theoretical computer science is logic, semantics, and the theory of program
