HN recommends it repeatedly as one of the best and most entertaining programming talks, and as the talk that makes the Y combinator click, even for people who do not use Ruby.
Topics › Mathematics & Theoretical CS
The best computability & complexity theory videos, according to Hacker News
34 videos about computability & complexity theory that Hacker News commenters keep pointing each other to, ranked by how many separate months they were recommended. Part of Mathematics & Theoretical CS.
HN commenters call it one of the best security talks and the standard introduction to LANGSEC, which they use to argue for simpler, well-specified input formats.
HN regards it as an entertaining and eye-opening introduction to why logic and functional programming are connected, and it is a frequent pick in favorite-tech-talk threads.
HN calls it a legendary, clearly explained hacker talk whenever mov-only computing or anti-decompilation comes up.
HN commenters recommend it as a clear, accessible introduction to incompleteness and the self-referential proof idea.
HN repeatedly names it as one of the funniest and best talks, a favorite example of absurd computation.
The canonical visual for nested simulation, Turing completeness and self-reference; HN readers call it mind-blowing and reach for it constantly.
Repeatedly recommended as one of the most approachable introductions to lambda calculus and combinators.
HN recommends it as an accessible explanation of number categories and why almost all numbers are unknowable.
HN repeatedly recommends it as the best short, funny introduction to P vs. NP and complexity classes for people with no background.
Strongly recommended in lambda calculus and Y-combinator threads as a mind-expanding half hour that clarifies the ideas.
HN calls it a brilliant, mind-bending introduction to lambda calculus for programmers.
Repeatedly recommended in best-talks threads as a fun, mind-blowing demonstration of unexpected computation.
Recommended as a jaw-dropping, must-see talk that gives an amazing intro to static analysis alongside Might's personal story.
HN points to it as an accessible long-form introduction to Wolfram's ideas and a window into his passion, though some are critical of his claims.
HN recommends it for getting the inventors of major concurrency models together, disagreements included.
HN recommends it as an accessible way into Wolfram's physics ideas and his personality.
Recommended as an intuitive, animated explanation of P vs NP framed around reversing computation.
HN likes it as a funny, entertaining presentation, frequently linked in threads on NP-hardness of games and NES automation.
HN recommends Sipser's free lectures as the companion to the standard theory of computation textbook and a path to understanding how computers fundamentally work.
Recommended as a companion to reading the dense book.
HN links it as the accessible, hands-on demo behind the claim that Magic is Turing complete.
Recommended in large-number threads as going further than other popular videos on Graham's number and ordinals.
HN points to it as a detailed explanation of Wolfram's physics hypothesis, and for Wolfram's evident passion, though some find it long.
Offered as a short, clear explanation of the halting problem and its link to decidability.
Cited whenever commenters want to note that Conway did not enjoy being known mainly for the Game of Life.
Mentioned in lambda calculus and combinator threads as a visual entry point to the topic.
Pointed to in Busy Beaver threads as an accessible expert talk on the topic.
HN shares it as a fun, memorable way to explain the longest path problem and as an entry in lists of programming and math songs.
HN cites it as an impressive example of building computation inside Dwarf Fortress.
Cited in debates over whether computer science is a science, and for Abelson's line that it is neither a science nor about computers.
Cited as the real-world example of an inescapable loop in Magic: The Gathering, in discussions of its Turing completeness.
HN commenters use it as an illustration of how simple rules can produce surprisingly complex behavior.
HN cites it as the classic example of a mechanical binary adder and a source of inspiration for marble-based computers.
Which of these have you already seen?
Connect YouTube and HackerTube AI hides what you've watched and ranks the rest for you.