HONORS THEORY OF COMPUTATION
SPRING 2002
READING GUIDE: Chapters 3-6
-
Chapter 3: Read the proof of Cook's Theorem (section 4).
You may also read lightly the first 3 Sections.
The results in these 3 sections are a gentle introduction to
what we will do more systematically in Chapter 4.
-
Chapter 4: Read the first 4 sections.
Required topics are
(i) many-one reducibility,
(ii) Turing reducibility,
and (iii) Efficient Universal Machines.
You should also know about the
Polynomial Analogue of Post's problem (Section 7).
-
Chapter 5:
Just read Section 1. You should try to prove
that some of the canonical classes have complete languages
(we sketch only some of these results).
-
Chapter 6:
Just read the first two sections.
You need to know how to use diagonalization to
separate two classes.