This course studies computational theory in the context of theoretical computer science and mathematics. Topics include finite automata and languages, computability and Turing machines. Decidability and incompleteness theorems will be covered if time permits.
Prerequisites
MATH 181 OR 281
Crosslisted
Semester Offered
Fall/Spring