HONORS THEORY OF COMPUTATION
SPRING 2002

---

READING GUIDE: Choice Computation and Alternating Machines

• Here is a slightly updated version of chapter 7: [postscript | pdf]
• Read sections 1, 2 and 3 for the basic material.
  Note that we can define valuations using either "sets of configurations" or "computation trees". They are very similar, so it is enough to stick to one of them (say, use only Tree Valuations, section 3.1).
• Skim quickly over section 4 (basic results).
• Theorem 18 in section 5 is a key result to know. The rest of the section can be omitted.
• Skip sections 6 and 7.
• Section 8 has a major result, and introduces a game on graphs. We will cover this result.
• Skip Section 9 and following.