CSC 544 - Lecture Notes
Introduction
Regular Languages - Finite Automata
Regular Languages - NFA & Pumping Lemma
Generators & Recognizers(updated)
Context-Free Languages(updated)
Turing Machines
Turing Machines (Cont.)
Decidability (updated 2/9)
Decidability, Part II
Reducibility
The Mathematics of Functions (new!)
Recursive Functions (updated 2/26)
First Order Logic
Algorithmic Information Theory
Time Complexity
Time Complexity Part 2, P-NP
Time Complexity Part 3, NP-completeness
Time Complexity Part 4, NP-completeness & Cook-Levin
Space Complexity Part 1
Space Complexity Part 2 (Savitch Proof)
Approximation Algorithms
Parallel Computation