CSC 544 - Lecture Notes
Introduction
Regular Languages - Finite Automata
Regular Languages - NFA & Pumping Lemma
Generators & Recognizers
Context-Free Languages (CFL pumping lemma illustr.)
Turing Machines
Turing Machines (Cont.)
Decidability
Decidability (Cont.)
Reducibility
Lambda Calculus
The Mathematics of Functions
Recursive Functions
Time Complexity
Time Complexity Part 2, P-NP
Time Complexity Part 3, NP-completeness
Time Complexity Part 4, NP-completeness & Cook-Levin
Space Complexity a nice version of Savitch's Proof
Algorithmic Information Theory