Completed
20 TM variants
Class Central Classrooms beta
YouTube videos curated by Class Central.
Classroom Contents
Introduction to the Theory of Computing - Stanford
Automatically move to the next video in the Classroom when playback concludes
- 1 1 computing
- 2 2 curriculum
- 3 4 proofs
- 4 5 DFA Overview
- 5 6 DFA
- 6 7 DFAClosure1
- 7 8 NFA
- 8 9 NFA2DFA
- 9 10 DFA Closure2
- 10 11 RegExp
- 11 12 pumping
- 12 13 minimizingDFA
- 13 14 Myhill Nerpde
- 14 15 learning DFA
- 15 16 Streaming
- 16 17 CC
- 17 18 TM overview
- 18 19 TM
- 19 20 TM variants
- 20 21 Universal TM
- 21 22 counting argument
- 22 23 concrete undecidable
- 23 24 mapping reductions
- 24 25 rices theorem
- 25 26 oracle reductions
- 26 27 self reference
- 27 28 logic
- 28 29 Kolmogorov Complexity
- 29 30 complexity overview
- 30 31 time complexity
- 31 32 NP
- 32 33 poly time reductions
- 33 34 Cook Levin
- 34 35 more NPC
- 35 36 co NP
- 36 37 polynomial hierarchy
- 37 38 space complexity
- 38 39 Proofs++
- 39 40 Algortihmic Fairness
- 40 41 Randomness
- 41 42 Parting thoughts
