Apr 26, 2018  
College Catalog 2013-2014 
College Catalog 2013-2014 [ARCHIVED CATALOG]

MATH 361 - Theory of Computation

Cross-Listed as  
A discussion of the basic theoretical foundations of computation as embodied in formal models and descriptions. The course will cover finite state automata, regular expressions, formal languages, Turing machines, computability and unsolvability, and the theory of computational complexity. Introduction to alternate models of computation and recursive function theory. Prerequisite(s):   and  , or permission of instructor Every spring. (4 Credits)