.

• Introduction
• Mathematical Tools
• Finite State Automata
• Push Down Automata / Context Free Languages
  • Part 1
  • Part 2
  • Part 3
• Turing Machines
• Decidability (Sipser, Chapter 4).
• More Decidability
• Did we mention decidability?
• Reducibility
• Reducibility Redux
• Mapping Reducibility
• Complexity
• More Complexity
• Complexity Cubed
• NP-completeness
• Mo' NP
• Space Complexity: The Final Frontier
• CS 152: A Space Odyssey
• Inner Space
• Space Balls
• Intractability
• Random Thoughts on Random Algorithms
• Complete and Total Randomness
• Probably Approximately Correct Lecture
• Appoximation Theory