Physics doesn't explain the universe. Computation does | Stephen Wolfram: Full Interview

Scientific Concepts, Discoveries, and Nature Phenomena

Computation as the Foundation Under Physics

• The universe is modeled as rule-based computation: applying simple rules can generate the observed complexity of physical reality.
• A key distinction is emphasized between:
  • Models / representations of computation, versus
  • the claim that there is literally a conventional “computer” running the universe.

Limits of Traditional Theoretical Physics

As described, 20th-century physics centers on:

• General relativity (space-time and gravity)
• Quantum mechanics
• Statistical mechanics, especially:
  • the second law of thermodynamics
  • increasing randomness, i.e., entropy growth

The speaker argues these theories reflect deeper computational constraints rather than being fully “reducible” in the classical scientific sense.

Computational Irreducibility

• Main idea: for many systems, knowing the update rules is not enough to predict outcomes without effectively running the process step-by-step.
• This is presented as a fundamental limit on prediction inside science.
• Conceptually linked to:
  • mathematical incompleteness ideas (e.g., Gödel)
  • “computational equivalence”

Ruliology (Study of Rules and Their Consequences)

• Computation is reframed as: follow rules → see what happens.
• “Ruliology” is described as the study of simple rules producing consequences, including:
  • arithmetic rules
  • spatial / neighbor-dependent update rules (e.g., cellular automata)
  • other formal computation models

Cellular Automata

• Defined as grids of cells (e.g., black/white) updated in discrete steps using rules based on local neighborhoods.
• Claim/discovery: very simple rules can generate arbitrarily complex behavior.
• Elementary cellular automata highlighted:
  • 256 simplest 1D neighborhood rules (binary-state, nearest-neighbor)
  • the speaker claims that over decades, essentially all of these rules were found useful as models across multiple domains
• Rule 30 singled out:
  • starts from a minimal initial condition (e.g., a single cell)
  • produces patterns with some regularities, but a center column that appears random/unpredictable in practice
  • used as an analogy to random-looking sequences, such as digits of π

Natural Systems Modeled Computationally

• Snowflake growth: described as building arms recursively via simple aggregation rules (rule-driven growth and morphology).
• Biological growth and pattern formation, especially mollusks:
  • spirals in mollusk shells
  • pigmentation patterns as cell-by-cell production/absence of pigment evolving into complex shell designs
  • presented as compatible with cellular-automaton-like rules

Biological Evolution and the Search for Theory

• Evolution framed as a computational process that can increase complexity:
  • evolution does not necessarily “get stuck”
  • it can produce more elaborate forms when fitness objectives and evolving mechanisms align
• Linked to:
  • machine learning (including a “2010s” observation that sufficiently trained neural nets eventually learn)
  • computational evolution (simple computational systems can evolve toward complex fitness goals)
• Darwin’s expectation of an abstract “law” governing evolutionary progress is contrasted with the difficulty of finding such laws.

How Quantum Mechanics and Classical Physics Emerge (Proposed Framework)

Discrete space and graph-based time evolution

• A microscopic picture is proposed:
  • space is discrete, consisting of “atoms of space” represented as nodes of a graph/network
  • time corresponds to successive rewriting of parts of the graph via local rules

Emergence of classical / relativity-like behavior

• Aggregate behavior of local rewrites is argued to yield general relativity-like physics (Einstein equations) as a macroscopic outcome, analogized to how fluid mechanics emerges from molecular dynamics.

Emergence of quantum mechanics

• Because different parts of the network can be rewritten in different orders / “threads of history,” probabilities over many paths yield quantum behavior.

Multiple computational rules

• Rather than one fixed “designed” rule, it is suggested that all possible rules are realized somewhere in the overall structure.

The Ruliad (Global Object of All Computations)

• Introduced as a unique abstract limit/structure:
  • the entangled limit of all possible computations
  • different computational systems can converge to the same outputs
• Rulial space (a space of perspectives):
  • observers / “minds” correspond to positions within this space
  • proximity implies more similar perceptions

Branchial Space

• Defined as the quantum-mechanics “space of possible branches / histories,” contrasted with broader rulial space.

Second Law of Thermodynamics / Irreversibility as Observer-Relative

• Irreversibility is explained via computational limitations:
  • microscopic dynamics are reversible in principle
  • but observers with finite computational power cannot reconstruct hidden causes
  • so outcomes appear random, aligning with the entropy-increasing second law

Observer Assumptions Shaping Perceived Laws

Observers like humans are characterized as:

• computationally bounded (finite minds)
• having belief in persistence over time (single-thread experience)

These properties are claimed to make certain “laws of nature” the kinds of regularities that become perceivable.

Computational “Reducibility Pockets”

• Even within irreducible computation, there are said to be infinite pockets where prediction/regularity is possible.
• “Laws of nature” are interpreted as patterns that bounded observers can repeatedly sample and exploit.

Meaning of Life / Free Will / AI

• Free will framed as an “irreducible gap”:
  • deterministic rules exist (in principle)
  • but predicting a whole system’s specific action requires effectively running the full computation
  • therefore, knowing the rules does not let one foresee exact moments of action
• AI safety / predictability trade-off:
  • restricting to predictable (reducible) behavior reduces capability
  • embracing potentially irreducible computation grants power but introduces surprises
• The human role is framed as selecting which possibilities to pursue among many available in the computational universe.
• The “awesome-ness” of the universe is preserved by irreducibility: time and lived experience matter because outcomes aren’t fully extractable in advance.

Methodology / Models Described

Cellular Automaton Update Rule (Generic Form)

• Begin with a 1D line / grid of cells (e.g., black/white).
• For each time step:
  • for each cell, look at the cell and its neighbors from the previous step
  • consult a predefined lookup table corresponding to a rule number
  • assign the cell’s next color/state
• Observation: simple local rules can yield complex global patterns.

Computational “Telescope” Approach

• Treat the computational system as something you can run and observe:
  • “turn the computational rule system toward the sky”
  • explore emergent patterns/behaviors via simulation rather than analytic shortcuts

Researchers or Sources Featured (End)

• Stephen Wolfram
• Isaac Newton
• René Descartes
• Alan Turing (invented Turing machines, 1936)
• Moses Schönfinkel (combinators, invented 1920)
• Gödel (referenced via the conceptual lineage)
• Einstein (general relativity; referenced via Einstein’s equations)
• Darwin (Origin of Species referenced)
• Spinoza (quoted/attributed idea about the universe and God’s thoughts)