Fall 2020 Course Descriptions
COMP 170-01 Computation Theory
T. Wexler
MW 9:00-10:15, Online (synchronous)
R+ 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 COMP/MATH 22 or 61.