Spring 2024 Course Descriptions

CS 170-M1 Computation Theory

A. Winslow
R 5:30p-7:00p, Online (synchronous)

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