Mar 28, 2024  
College Catalog 2009-2011 
    
College Catalog 2009-2011 [ARCHIVED CATALOG]

COMP 261 - Theory of Computation


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. Every spring. Prerequisite(s):     or permission of instructor. (4 Credits)