Finite automata, Turing machines, formal languages, graph theory, combinatorial optimization, complexity of algorithms, P versus NP, and decidable versus undecidable problems. Prerequisite: C or better in MATH 3314.