Proof the halting problem is unsolvable


Alan Turing almost accidentally created the blueprint for the modern day digital computer. Here Mark Jago takes you through The Halting Problem.


One of the most influential problems and proofs in computer science, first introduced and proved impossible to solve by Alan Turing. The video provides the idea of this incredibly clever proof.


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.


Lex Fridman Podcast full episode.


One of the most influential problems and proofs in computer science, first introduced and proved impossible to solve by Alan Turing. The video provides the idea of this incredibly clever proof.