42:43Computability & 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 “programming history”
3 videos42:43
1:02:15Lambda Calculus - Fundamentals of Lambda Calculus & Functional Programming in JavaScript
Fullstack Academy
5 HN recommenders
1:06:45Let's #TalkConcurrency Panel Discussion with Sir Tony Hoare, Joe Armstrong, and Carl Hewitt
Erlang Solutions
3 HN recommenders
Sources 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