Computational Equivalence
Stephen delves into the concept of computational irreducibility, challenging the traditional scientific notion of predicting the future based on known rules. He introduces the principle of computational equivalence, highlighting that systems exhibiting complex behavior are computationally sophisticated, shedding light on the limitations of predicting outcomes without explicit computation.In this clip
From this podcast

Machine Learning Street Talk (MLST)
#110 Dr. STEPHEN WOLFRAM - HUGE ChatGPT+Wolfram announcement!
Related Questions
Is the universe computable as discussed in the episode Stephen Wolfram: ChatGPT and the Nature of Truth, Reality & Computation | Lex Fridman Podcast #376 and the clip Computational Irreducibility?
Can formal systems be computed as discussed in the episode Stephen Wolfram: Cellular Automata, Computation, and Physics | Lex Fridman Podcast #89 and the clip Infinity and Computation, in relation to the episode Edward Frenkel: Reality is a Paradox - Mathematics, Physics, Truth & Love | Lex Fridman Podcast #370 and the clip Mathematical Foundations?
Can formal systems be computed as discussed in the episode Stephen Wolfram: Cellular Automata, Computation, and Physics | Lex Fridman Podcast #89 and the clip Computational Foundations of Physics, in relation to the episode Edward Frenkel: Reality is a Paradox - Mathematics, Physics, Truth & Love | Lex Fridman Podcast #370 and this Mathematical Foundations?