Prerequisite:CS 295 or MA 395 or written permission of the instructor. Basic results on the capabilities, limitations, and applications of formal models of computation. Includes finite state machines, push down automata, grammars, computable and noncomputable functions, and NP-completeness. (Spring only)