CS 614 THEORY OF COMPUTATION   3.0 Credit(s)
Reviews the theory of the power and limitations of computation and computers: Turing machines, recursive and recursively enumerable functions, equivalence of computing paradigms (Church-Turing thesis), undecidability, intractability, and introduction to NP-completeness. Prerequisite: Take CS-551
Offered: Late Spring Semester All Years

Go back to previous page