CECS 419-519 Lectures

  1. Review of Computability
  2. Review of Computability (Annotated)
  3. Undecidability and the Diagonalization Method
  4. Undecidability and the Diagonalization Method (Annotated 10/19/23)
  5. Undecidability and the Diagonalization Method (Annotated 10/24/23)
  6. Kleene's 2nd Recursion Theorem and Self-Referencing Programs
  7. Kleene's 2nd Theorem and Self-Knowing Programs (Annotated 10/31/23)
  8. Kleene's 2nd Theorem and Self-Knowing Programs (Annotated 11/2/23)
  9. Kleene's 2nd Theorem and Self-Knowing Programs (Annotated 11/7/23)
  10. Introduction to Information Theory
  11. Introduction to Information Theory (Annotated)
  12. Introduction to Kolmogorov Complexity
  13. Introduction to Kolmogorov Complexity (Annotated)
  14. Autoreducibility of Random Sequences
  15. Autoreducibility of Random Sequences (Annotated)
  16. Introduction to Complexity Theory
  17. Introduction to Complexity Theory (Annotated)
  18. Introduction to Complexity Theory (Annotated March 15th)
  19. Introduction to Complexity Theory (Annotated April 12th)
  20. Turing Machines
  21. Turing Machines (Annotated)
  22. Time Hierarchy Theorem
  23. Time Hierarchy Theorem (Annotated)
  24. Space Complexity
  25. Space Complexity (Annotated)
  26. Polynomial Space Complexity
  27. Polynomial Space Complexity (Annotated)
  28. Log Space Complexity
  29. Log Space Complexity (Annotated)