STEPHEN WOLFRAM VISITS RWRI 19, SUMMER SCHOOL 2024
N N Taleb's Probability Questions (UNOFFICIAL)
00:00
Demonstrating Computation That Is Unskippable
He distinguishes knowing rules from being able to shortcut their execution, the core of computational irreducibility.
Play episode from 39:43
Transcript
