Spring 2021 Course Descriptions

COMP 170-01 Computation Theory

L. Cowen
TR 12:00-1:15, Online
F+ 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.

Back to Main Courses Page