CSC 544 - Lecture Notes
Introduction
Regular Languages - Finite Automata
Regular Languages - NFA & Pumping Lemma
Genrators & Recognizers
Context-Free Languages
Breakout: Finite & Infinite Languages (updated 3/13/07)
Turing Machines
Turing Machines (Cont.)
Decidability
Undecidability
Reducibility
mu-Recursive Functions
Breakout: Diagonalization Techniques (updated 3/13/07)
First Order Logic (updated 3/13/07)
Algorithmic Information Theory (updated: 3/8/07)
Time Complexity
Time Complexity Part 2, P-NP
Time Complexity Part 3, NP-completeness (updated 3/29/07)
Time Complexity Part 4, NP-completeness & Cook-Levin (updated 4/5/07)
Space Complexity Part 1
Space Complexity Part 2
Approximation Algorithms
Parallel Computation