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.
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
Public CS 243 Web Site
Staff Office Hours
Robert R. Snapp
--
--
Homework
Nothing has been added to the Homework section, yet. Stay tuned!
Lecture Notes
Nothing has been added to the Lecture Notes section, yet. Stay tuned!