CECS 329 Lectures

  1. Review of Logic, Sets, Functions, Graphs, Big-O notation, and Algorithms
  2. Review of Logic, Sets, Functions, Graphs, Big-O notation, and Algorithms (Annotated)
  3. Turing Reducibility
  4. Turing Reducibility (Annotated)
  5. Mapping Reducibility
  6. Mapping Reducibility (Annotated)
  7. Introduction to Complexity Theory
  8. Introduction to Complexity Theory (Annotated)
  9. Finite Automata
  10. Finite Automata (Annotated up to page 12)
  11. Finite Automata (Annotated pages 13-44)
  12. Context Free Languages
  13. Context Free Languages (Annotated)
  14. Turing Machines
  15. Turing Machines (Annotated)
  16. Computability Basics
  17. Computability Basics (Annotated)
  18. The Diagonalization Method
  19. The Diagonalization Method (Annotated)
  20. Kleene's 2nd Recursion Theorem and Self-Referencing Programs
  21. Kleene's 2nd Recursion Theorem and Self-Referencing Programs (Annotated)