Reviews regular expressions and finite automata. studies turning machines and equivalent models of computation, the Chomsky hierarchy, context-free grammars, push-down automata, and computability. Machine models of effective computability; sub-recursive hierarchies; P and NP problems; effective and efficient reducibility; time, space, and abstract complexity.