The video explains how David Hilbert’s 1928 challenge—asking whether mathematics is complete, consistent, and decidable—led Alan Turing to formulate the halting problem: can we write a program that determines whether any other program will eventually stop or run forever? Turing showed that such a program cannot exist by assuming a hypothetical “Hal” predictor and constructing a self‑referential program “Barry” that does the opposite of Hal’s prediction, producing a logical contradiction. This proof demonstrates that some mathematical questions (like the Goldbach conjecture) are undecidable—no algorithm can settle them—and implies inherent limits to what even a human mind (viewed as a computational process) can know. The video ends with a promotion for Skillshare programming courses and a link to a quantum‑computing‑style game.
1. The episode is supported by Skillshare.
2. In 1928 mathematician David Hilbert posed three questions to the mathematics community.
3. Hilbert’s first question: Is mathematics complete? (Can we prove everything that’s true?)
4. Hilbert’s second question: Is mathematics consistent? (Does it give non‑contradictory answers?)
5. Hilbert’s third question: Is mathematics decidable? (For every mathematical problem, is there a step‑by‑step method to determine truth or falsity?)
6. Hilbert believed all three questions would be answered affirmatively.
7. Alan Turing considered Hilbert’s third question and formulated the halting problem: can we write a program that tells whether any other program with a given input will halt or run forever?
8. A program is a sequence of instructions understandable by a computer; inputs are values given to the program.
9. The Goldbach conjecture states that every even integer greater than 2 can be expressed as the sum of two primes.
10. A program that searches for a counterexample to the Goldbach conjecture halts iff it finds an even number that is not the sum of two primes.
11. If we could decide whether such a program halts, we could settle the Goldbach conjecture and many similar problems.
12. Turing proved the halting problem is undecidable by assuming a halting‑decider program H exists and constructing a program B that does the opposite of H on its own input, leading to a contradiction.
13. Therefore no program can correctly decide halting for all program‑input pairs.
14. Turing’s result also answered Hilbert’s third question negatively: there exist mathematical problems that are undecidable.
15. The undecidability implies limits on what can be computed, regardless of technology or time.
16. Skillshare offers classes on programming languages such as Python, Java, and C++, with beginner‑friendly step‑by‑step instructions.
17. Skillshare also offers non‑programming classes, e.g., how to make French macaroons.
18. Skillshare is providing a promotion: the first two months free for viewers who sign up via a given link.
19. A viewer from the University of Ariston created a game that lets users solve problems similar to those quantum computers address, to help scientists study differences between human and quantum problem solving.