Fall 2015 Course Descriptions

COMP 170-01 Computation Theory

L. Cowen
TR 10:30-11:45, Braker Hall 001
D+ 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