Computability and Complexity Slides and Readings, Winter 2009

• Jan 13, 2009: Introduction, Turing machines, Decidability etc.
  • Slides: Introduction and Computability
  • Reading: Arora/Barak Chap 1, Sipser Chapters 3-4
  • A wonderful relevant article
• Jan 20, 2009: Undecidability, part 2.
  • Slides: Finish slides from lecture 1 + Undecidability and more
  • Reading: Sipser, Chapter 5, Article on large numbers , and Some material on complexity from MIT GITCS, Sections 2-3
• Jan 27, 2009: NP-completeness, part 1
  • Slides: Finish slides from lecture 2 + NP-completeness part 1
  • Reading: Arora/Barak Chap 2, Sipser, Chapter 7
• Feb 3, 2009: NP-completeness, part 2
  • Slides: NP Completeness part 2
  • NP-completeness: A retrospective by Christos Papadimitriou
  • The history and status of the P vs NP question by Mike Sipser. (Includes the famous letter of Godel to von Neumann.)
• Feb 10, 2009: Space Complexity
  • Slides: Space Complexity + Randomized Complexity
  • Sipser, Chap 8 and Section 10.2; Arora/Barak Chapter 4 and Chapter 7.
• Feb 17, 2009: Interactive Proofs
  • Reading: Sipser, Section 10.4; Arora/Barak Chapter 8
• Feb 24, 2009: The PCP Theorem and hardness of approximation
  • Reading: Arora/Barak Chapter 11
• March 3, 2009: Cryptography
  • Slides: Crypto slides
  • Reading: Sipser, Section 10.6; Arora/Barak Chapter 9.
• March 10, 2009: Student Presentations
• Monday, March 16, 2009: Student Presentations