Halting Problem
problem of determining whether a given program will finish running or continue forever
Build a research pod on Halting Problem.
6 expert discussions. Save them all to your own pod, ask any question, get cited answers.
Common Themes
Videos Mentioning Halting Problem
All-In Summit: Stephen Wolfram on computation, AI, and the nature of the universe
All-In Podcast
A famous undecidable problem in computer science, related to computational irreducibility.
Ep 18: Petaflops to the People — with George Hotz of tinycorp
Latent Space
Used as an analogy for the complexity in CPUs related to predicting branch execution, which is simplified in neural networks.
Michael Littman: Reinforcement Learning and the Future of AI | Lex Fridman Podcast #144
Lex Fridman
A fundamental problem in computer science about determining if any given program will finish or run forever; it was the subject of one of Michael Littman's challenging parody songs.
Bjarne Stroustrup: C++ | Lex Fridman Podcast #48
Lex Fridman
An undecidable problem in computer science mentioned as a boundary for static analysis; full program proof on complex systems is generally impossible.
The Minimal Productivity System That Could Reinvent Your Life | Cal Newport
Cal Newport
The first unsolvable problem identified by Turing, discussed in the context of computational limits.
Cal Newport: Deep Work, Focus, Productivity, Email, and Social Media | Lex Fridman Podcast #166
Lex Fridman
The first problem proven by Alan Turing to be unsolvable by an algorithm, a foundational impossibility result in computer science.