Go Home
Materials
Guides and Links
Refresh page to see latest lectures
Syllabus
M1
Regular Languages
prerequisites.pdf
finite_automata.pdf
nondeterminism.pdf
regular_expressions.pdf
GNFAs.pdf
pumping_lemma.pdf
more_problems.pdf
M2
Context-free Languages
CFGs.pdf
PDAs.pdf
CFG_to_PDA.pdf
pumping_CFLs.pdf
M3
The Church-Turing Thesis
TMs_deciders_recognizers.pdf
Turing-completeness.pdf
algorithms.pdf
decidable1.pdf
decidable2.pdf
NTMs_and_NP_problems.pdf
extra1.pdf
extra2.pdf
Exams
Study Guide 1
Study Guide 2
Videos
Halting Problem
Game of Life
Life is Turing-Complete
P vs. NP
Mario is (NP-) Hard
Animations
3SAT to Clique
Clique to Stable Set
3SAT to Hamiltonian
Research
Classic Games are Hard
Undecidable Mario Levels
Portal & Other 3D Games
graphclasses.org