Turing & The Halting Problem - Computerphile
What it is
A Computerphile video in which Mark Jago of the University of Nottingham explains Turing's halting problem and how it led to the blueprint for the modern computer.
Why Hacker News recommends it
Offered as a short, clear explanation of the halting problem and its link to decidability.
- 2 people recommended it
- 2 different months
- 0 strong recommendations
- first 2019, last 2022
What HN commenters said
“there's this glorious liar paradox machine discussed by Computerphile”
Liar paradox machine illustrating link between incompleteness and decidability
mar77i, 2019-12 · Recommendation · in “Kurt Gödel and the Mechanization of Mathematics”
“Here's a short video on it”
Short explanation of the halting problem
gammalost, 2021-06 · Recommendation · in “DeepMind says reinforcement learning is ‘enough’ to reach general AI”
Excerpts from Hacker News comments, linked to the originals. Summaries and labels were written by a language model from those comments.
Topics: halting problem, alan turing, computability, decidability, computer science theory
Also recommended by the same people
talkRuby Conf 12 - Y Not- Adventures in Functional Programming by Jim WeirichConfreaks · 17 HN recommenders · 2013–2026
talk28c3: The Science of Insecurity28c3 · 9 HN recommenders · 2012–2024
talk"Propositions as Types" by Philip WadlerStrange Loop Conference · 9 HN recommenders · 2015–2026
talkBreak Me00 The MoVfuscator Turning mov into a soul crushing RE nightmare Christopher DomasAdrian Crenshaw · 6 HN recommenders · 2017–2026
explainerMath's Fundamental FlawVeritasium · 7 HN recommenders · 2021–2024
talkOn The Turing Completeness of PowerPoint (SIGBOVIK)Tom Wildenhain · 8 HN recommenders · 2017–2025
demoLife in lifePhillip Bradbury · 6 HN recommenders · 2013–2025
lectureLambda Calculus - Fundamentals of Lambda Calculus & Functional Programming in JavaScriptFullstack Academy · 5 HN recommenders · 2019–2024