40:50Computability & complexity theory
Theory of computation: Turing machines, halting problem, P vs NP, complexity classes, lambda calculus, automata, Church-Turing, Goedel incompleteness, computability.
- Topic: Computability & complexity theory
Results for “lean”
2 videos40:50
3:26:34Sources and selection
Indie Picks is organized from video metadata and uploader descriptions; it is not a full-video editorial review. HN Library retains community discussions. Sources and data notes