CSCI 383 - Theory of Computer Science

Semester Offered: First Semester
Credits (Range): 3 hours
Attribute: 3NS, QP-F

This is a course on models of computation and the limits of computability. The first part of the course discusses mathematical models of computation and the problems that can be solved by each model. The second part of the course discusses problems that cannot be solved by any algorithmic process. The final sections of the course are devoted to a categorization of problems by how efficiently they can be solved.
Instructor: A. Sharp
Prerequisites & Notes
Prerequisite: MATH 220 and CSCI 280 or consent of the instructor.