3-3-0

The course will include several of the following topics: Computational models, Computational complexity; Finite-state machines; Context free languages; Pushdown automata; Turing machines; Undecidable problems.

Prerequisite: CSC204, Math 105



Note: See Mat 275. Students may not receive credit for this course if they have already received credit for Mat 275, nor can they receive credit for both CSC 305 and CSC 405