---

[WesMaps 98/99 Home Page] [Course Search] [Course Search by CID]

Theory of Computation COMP302 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

EXAMINATIONS AND ASSIGNMENTS

ADDITIONAL REQUIREMENTS and/or COMMENTS

COURSE FORMAT: Lecture

REGISTRATION INFORMATION

Level: UG Credit: 1.00

Prerequisites: COMP212 and MATH228

Last Updated on MAR-22-1999