CECS 329 Lectures

1. Review of Sets and Graphs
2. Review of Sets and Graphs (Annotated)
3. Mapping Reducibility
4. Mapping Reducibility (Annotated)
5. Introduction to Complexity Theory
6. Introduction to Complexity Theory (Annotated)
7. Computability Basics
8. Computability Basics (Annotated)
9. Undecidability and the Diagonalization Method
10. Undecidability and the Diagonalization Method (Annotated)
11. Undecidability and the Diagonalization Method (Annotated March 12th)
12. Kleene's 2nd Recursion Theorem and Self-Referencing Programs
13. Kleene's 2nd Recursion Theorem and Self-Referencing Programs (Annotated)
14. Kleene's 2nd Recursion Theorem and Self-Referencing Programs (Annotated March 21st)
15. Kleene's 2nd Recursion Theorem and Self-Referencing Programs (Annotated March 26th)
16. Finite Automata
17. Finite Automata (Annotated)
18. Context Free Languages
19. Context Free Languages (Annotated)
20. Turing Machines
21. Turing Machines (Annotated)