Spring 2012 Course Descriptions
COMP 170-01 Computation Theory
MW 10:30-11:45, Anderson Hall Nelson Aud.
E+ Block
Models of computation: Turing machines, pushdown automata, and finite automata. Grammars and formal languages including context-free languages and regular sets. Important problems including the halting problem and language equivalence theorems.
Prerequisite: COMP 15 and MATH 22.