computational irreducibility
Type: Concept
As of November 2026, computational irreducibility has been mentioned in one podcast episode on Young and Profiting (Dec 2025).
Computational irreducibility suggests certain computational processes cannot be simplified and the only way to determine the outcome of a process is to go through each step of its computation. It is one of the main ideas proposed by Stephen Wolfram in his 2002 book A New Kind of Science, although the concept goes back to studies from the 1980s.
| Mentioned in | 1 episode on 1 podcast (as of November 2026) |
|---|---|
| First heard | Dec 2025 on Young and Profiting |
Who talks about computational irreducibility on podcasts?
computational irreducibility came up; the most recent mention was Dec 2025 on Young and Profiting.
What is computational irreducibility mentioned alongside?
computational irreducibility is most often mentioned alongside Wolfram Research, neural nets and AI Vault series.
Mentioned together: Wolfram Research, neural nets, AI Vault series, Steven Wolfram, Wolfram|Alpha, Computational science, Intelligence, Computational thinking, Spacecraft, Particle physics