Summer 2021 Course Descriptions

COMP 170-C Computation Theory

M. Allen
T 6:00p-7:30p, Online

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