Theoretical Computer Science

Theoretical computer science

Theoretical computer science includes areas of discrete mathematics relevant to computing. It draws heavily on graph theory and logic. Included within theoretical computer science is the study of algorithms for computing mathematical results. Computability studies what can be computed in principle, and has close ties to logic, while complexity studies the time taken by computations. Automata theory and formal language theory are closely related to computability. Petri nets and process algebras are used to model computer systems, and methods from discrete mathematics are used in analyzing VLSI electronic circuits. Computational geometry applies algorithms to geometrical problems, whilecomputer image analysis applies them to representations of images. Theoretical computer science also includes the study of various continuous computational topics

Source : http://en.wikipedia.org/wiki/Discrete_mathematics