CSC 30400 Introduction to Theoretical Computer Science
Finite state automata, pushdown automata, Turing Machines, and the languages they can recognize. Church's Thesis. Compatibility. The classes P and NP; NP-complete problems and intractable problems.
Contact Hours
3 hr./wk.