COSC 304 - Theory of Computing

This course introduces the different models of computation and focuses attention on the relative strength of each model and the relationship of one model to another. Concepts introduced include type theory, finite automata, regular expressions and languages, context-free grammars, push-down automata, Turing machines and their schema, diagonalization arguments, Church’s Thesis, the Halting problem, and computational complexity.

Credits: 1.00
When Offered: Fall semester only

Corequisite: COSC 304L
Prerequisites: COSC 290
Major/Minor Restrictions: None
Class Restriction: None
Area of Inquiry: Natural Sciences & Mathematics
Liberal Arts CORE: None

Click here for Course Offerings by term