MATH:482 Theory of Computation.

An introduction to the classical and contemporary theory of computation. Topics include the theory of automata and formal languages, computability by Turing machines and recursive functions, computational complexity and possibly quantum computers. Same as CSCI:482. Prerequisites: MATH:221 Discrete Structures and CSCI:281 Data Structures. 2 SH.