MA 208 - Theory of Computation

Computation models including finite state machines; Kleene’s theorem; push-down automata; lambda calculus; primitive recursive and recursive functions; Turing machines, computability, and the Halting Problem; NP completeness; other topics.

Prerequisites: MA 207 or MA 213

Credits: 4 cr.

Print this Page