CS-312   Logic, Computability and Complexity

Topics from the theory of computation including finite state concepts, formal languages and grammars, computability, computational complexity. Also listed as mathematics 312. Prerequisite: Mathematics 256.