Machine based and formal grammar based models of computation: finite automata; regular languages, context free languages, pushdown automata, and Turing machines; Church-Turing thesis; introduction to the halting problem.

3 Credit Hours