APM 5881 - The Theory of Computation

(4 credits)

A study of what kinds of computation can, in principle, be accomplished by what kinds of computing devices, and how efficiently such computations can be done. Finite automata, pushdown automata, Turing machines, languages, grammars, undecidability, complexity theory, intractability. Required background: a course in discrete mathematics. Formerly APM 581.

Prerequisite(s): Required background: a course in discrete mathematics.

Course revisions made after the Graduate Catalog publication date will be posted in the Graduate Catalog Addendum.