Future of Science and Technology Q&A (January 2, 2026)
The Stephen Wolfram Podcast
00:00
Interpretability and computational irreducibility limits
He argues mechanistic interpretability is hard due to computational irreducibility and complex basins of attraction.
Play episode from 01:14:13
Transcript
