This course will provide an introduction to several computational models which have been developed to formalize the notion of an algorithm. It will discuss in detail several of the primary topics in the theory of computation. These include the theory of recursive functions, Turing machines, and several undecidable problems such as the Halting and Word problems.
COURSE FORMAT: Lecture
Level: UG Credit: 1.00
Prerequisites: COMP212 and MATH228
Last Updated on MAR-03-1998
Copyright Wesleyan University, Middletown, Connecticut, 06459