E
Evan Redden
1
APPEARANCES
1
PODCASTS
012
DEC 30
JAN 6
JAN 13
JAN 20
JAN 27
FEB 3
FEB 10
FEB 17
FEB 24
MAR 3
MAR 10
MAR 17
MAR 24
MAR 31
APR 7
APR 14
APR 21
APR 28
MAY 5
MAY 12
MAY 19
MAY 26
JUN 2
JUN 9
JUN 16
JUN 23
JUN 30
JUL 7
JUL 14
JUL 21
JUL 28
AUG 4
AUG 11
AUG 18
AUG 25
SEP 1
SEP 8
SEP 15
SEP 22
SEP 29
OCT 6
OCT 13
OCT 20
OCT 27
NOV 3
NOV 10
NOV 17
NOV 24
DEC 1
DEC 8
DEC 15
DEC 22
DEC 29
JAN 5
JAN 12
JAN 19
JAN 26
FEB 2
FEB 9
FEB 16
FEB 23
MAR 2
MAR 9
MAR 16
MAR 23
MAR 30
APR 6
APR 13
APR 20
APR 27
MAY 4
MAY 11
MAY 18
MAY 25
JUN 1
JUN 8
JUN 15
JUN 22
JUN 29
JUL 6
JUL 13
JUL 20
JUL 27
AUG 3
AUG 10
AUG 17
AUG 24
AUG 31
SEP 7
SEP 14
SEP 21
SEP 28
OCT 5
OCT 12
OCT 19
OCT 26
NOV 2
NOV 9
NOV 16
Nov 14, 2026
Zero to One With Danny Goler #10 - Evan Redden: Can Math Prove We're Not in a Simulation?
E
12:23Evan ReddenGUEST
But essentially, the argument that they make in their paper and their paper is not just about this.
E
12:28Evan ReddenGUEST
They talk quite a bit about other forms of like undecidability in the universe and what implications that would have, you know, their whole meta theory of everything that they mentioned in that paper.
E
12:38Evan ReddenGUEST
My critique was specifically against the conclusion that they had made that our universe cannot be simulated by a Turing machine.
E
12:45Evan ReddenGUEST
The argument that they were making there is that there is phenomena in our universe, physical phenomena, where, you know, within the scope of a formal asthmatic system, so that would be like any system where you have a set of rules, like a set of axioms that you're acting under.
E
13:01Evan ReddenGUEST
Say, this letter can't be next to this letter unless this letter is there, and you have a formal language of syntax that has to be bounded to.
30 MINS LATER