CECS 419-519 Lectures
-
Review of Computability
-
Review of Computability (Annotated)
-
Undecidability and the Diagonalization Method
-
Undecidability and the Diagonalization Method (Annotated 10/19/23)
-
Undecidability and the Diagonalization Method (Annotated 10/24/23)
-
Kleene's 2nd Recursion Theorem and Self-Referencing Programs
-
Kleene's 2nd Theorem and Self-Knowing Programs (Annotated 10/31/23)
-
Kleene's 2nd Theorem and Self-Knowing Programs (Annotated 11/2/23)
-
Kleene's 2nd Theorem and Self-Knowing Programs (Annotated 11/7/23)
-
Introduction to Information Theory
-
Introduction to Information Theory (Annotated)
-
Introduction to Kolmogorov Complexity
-
Introduction to Kolmogorov Complexity (Annotated)
-
Autoreducibility of Random Sequences
-
Autoreducibility of Random Sequences (Annotated)
-
Introduction to Complexity Theory
-
Introduction to Complexity Theory (Annotated)
-
Introduction to Complexity Theory (Annotated March 15th)
-
Introduction to Complexity Theory (Annotated April 12th)
-
Turing Machines
-
Turing Machines (Annotated)
-
Time Hierarchy Theorem
-
Time Hierarchy Theorem (Annotated)
-
Space Complexity
-
Space Complexity (Annotated)
-
Polynomial Space Complexity
-
Polynomial Space Complexity (Annotated)
-
Log Space Complexity
-
Log Space Complexity (Annotated)