[ Wesleyan Home Page ] [ WesMaps Home Page ] [ WesMaps Archive ] [ Course Search ] [ Course Search by CID ]
Academic Year 2001/2002

Theory of Computation
COMP 302 SP

This course will provide an introduction to several computational models that 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.

MAJOR READINGS

To be announced

EXAMINATIONS AND ASSIGNMENTS

To be announced

ADDITIONAL REQUIREMENTS and/or COMMENTS

Additional Requirements and/or Comments not known

COURSE FORMAT: Lecture

REGISTRATION INFORMATION

Level: UGRD    Credit: 1    Gen Ed Area Dept: NONE    Grading Mode: Graded   

Prerequisites: (COMP212 AND MATH228) Links to Web Resources For This Course.

Last Updated on MAR-19-2002

Contact wesmaps@wesleyan.edu to submit comments or suggestions. Please include a url, course title, faculty name or other page reference in your email

Copyright Wesleyan University, Middletown, Connecticut, 06459