Theory of Computation

The Theory of Computation course includes topics in mathematical concepts of theorem and proof. In particular, the course will cover complexity theory, automata and language theory, computability theory, complexity theory, finite automata, regular expressions, push-down automata, Turing machines, Church-Turing thesis, decidability, time and space measures, hierarchy theorems, complexity classes P, and NP.