AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
6min chapter
#234 – Stephen Wolfram: Complexity and the Fabric of Reality
Lex Fridman Podcast
The Problem of Computational Irreducibility in Mathematics
In the late 1800s, people decided to try and formalize mathematics. They thought as soon as we've written down the axioms, then it'll just have a machine that can grind out all true theorems of mathematics. That got exploited by Goedle's theorem, which is basically the story of computational irreducibility. But in practical mathematics, mathematicians don't typically run into this; they just happily go along doing their mathematics. And so what gets really bizarre is thinking about kind of the analogy between metamathematics and physical universe.
00:00
Transcript
Episode notes
Get the Snipd
podcast app
Unlock the knowledge in podcasts with the podcast player of the future.
AI-powered
Discover
highlights
Listen to the best highlights from the podcasts you love and dive into the full episode
Save any
moment
Hear something you like? Tap your headphones to save it with AI-generated key takeaways
Share
& Export
Send highlights to Twitter, WhatsApp or export them to Notion, Readwise & more
AI-powered
podcast player
Listen to all your favourite podcasts with AI-powered features
Discover
highlights
Listen to the best highlights from the podcasts you love and dive into the full episode