scripod.com
#488 – Infinity, Paradoxes that Broke Mathematics, Gödel Incompleteness & the Multiverse – Joel David Hamkins

Overview

Shownote

Highlights

Transcript

Chapters

Pins

#488 – Infinity, Paradoxes that Broke Mathematics, Gödel Incompleteness & the Multiverse – Joel David Hamkins

Lex Fridman Podcast

2025/12/31
Lex Fridman Podcast

Lex Fridman Podcast

2025/12/31
OverviewShownoteHighlightsTranscriptChaptersPins

Shownote

Joel David Hamkins is a mathematician and philosopher specializing in set theory, the foundations of mathematics, and the nature of infinity, and he’s the #1 highest-rated user on MathOverflow. He is also the author of several books, including Proof and th...

Highlights

In this deep and wide-ranging conversation, mathematician and philosopher Joel David Hamkins explores the profound foundations of mathematics, from the nature of infinity to the limits of computation and proof. With clarity and insight, he unpacks concepts that have reshaped mathematical thought, guiding listeners through paradoxes, undecidability, and the philosophical implications of modern set theory.
13:23
Some infinities are bigger than others
40:54
Some infinities are larger than others, proven by diagonalization.
1:12:50
Russell's Paradox revealed a fatal flaw in Frege's logical foundation of mathematics.
1:26:18
No consistent formal system can prove its own consistency.
1:43:36
The provability problem is undecidable and equivalent to the halting problem.
2:00:21
Infinite trading among countably many people can make everyone infinitely rich.
2:11:10
We understand mathematical existence better than physical existence.
2:18:19
Answering questions on MathOverflow has made me a better mathematician
2:28:09
The Continuum Hypothesis is independent from the ZFC axioms.
2:38:43
Paul Cohen's forcing method proved the Continuum Hypothesis can be false in a consistent set-theoretic model.
2:55:18
Set-theoretic geology allows us to undo forcing, revealing deeper structure in models of set theory.
3:10:59
Determining if a cell will ever be alive in the Game of Life is undecidable, equivalent to the halting problem.
3:19:18
A random Turing machine's head falling off the tape explains most non-halting cases.
3:23:09
P vs NP is a theoretical question about asymptotic behavior
3:45:53
Every countable ordinal can be a game value in infinite chess.
4:02:08
The most beautiful idea in philosophy is the distinction between truth and proof.

Chapters

Introduction
00:00
Sponsors, Comments, and Reflections
01:58
Infinity & paradoxes
15:40
Russell's paradox
1:02:50
Gödel's incompleteness theorems
1:15:57
Truth vs proof
1:33:28
The Halting Problem
1:44:52
Does infinity exist?
2:00:45
MathOverflow
2:18:19
The Continuum Hypothesis
2:22:12
Hardest problems in mathematics
2:31:58
Mathematical multiverse
2:41:25
Surreal numbers
3:00:18
Conway's Game of Life
3:10:55
Computability theory
3:13:11
P vs NP
3:23:04
Greatest mathematicians in history
3:26:21
Infinite chess
3:40:05
Most beautiful idea in mathematics
3:58:24

Transcript

Lex Fridman: The following is a conversation with Joel David Hamkins, a mathematician and philosopher specializing in set theory, the foundations of mathematics, and the nature of infinity. He is the number one highest rated user on MathOverflow, which I t...