Computability and Complexity - Overview

1. Introduction to Computability and Complexity
2. Existence of unsolvable problems
3. The Halting Problem
4. Computational Complexity Theory
5. NP and NP-completeness

All of the above

See also:

Algorithm Design Paradigms

PED Home Page