Description

From the UVM Catalog: ``Reducibility and decidability, recursion theory, time and space complexity, P, NP, NP-completeness, PSPACE, PSPACE completeness, L and NL, advanced topics in computability and complexity''.

In plain English: We will formulate the fundamental capabilities and limitations of computers, and the amount of memory and number of operations required to compute solutions to a variety of canonical problems.

General Information


Announcements

Announcements are not public for this course.
Staff Office Hours
NameOffice Hours
Robert R. Snapp
When?
Where?

Homework

Lecture Notes