The halting problem is an important problem in computer science that asks whether we can construct an algorithm to determine whether a computer program will run forever. It turns out that the halting problem can't be solved, and in this video, we look at the proof to understand why.
***
Spanning Tree is an educational video series about computer science and mathematics. See more at https://spanningtree.me
To be notified when a new video is released, sign up for the Spanning Tree mailing list at https://spanningtree.substack.com/
Spanning Tree is created by Brian Yu. https://brianyu.me/
Email me at [email protected] to suggest a future topic.