Stephen Wolfram: Cellular Automata, Computation, and Physics | Lex Fridman Podcast #89

Lex Fridman talks with Stephen Wolfram about the nature of computation and why even extremely simple rules, like the cellular automaton rule 30, produce immense, irreducible complexity. Wolfram lays out his principle of computational equivalence and the idea of computational irreducibility, arguing there is no bright line between intelligence and mere computation. He details his then-fresh project to find a fundamental theory of physics using hypergraph rewriting, from which space, time, special relativity, and quantum mechanics could emerge. The conversation also covers building Wolfram Language and the Wolfram knowledge base, AI ethics and computational contracts, ego in science, and immortality.

• Wolfram announces he has just re-energized a public, live-streamed project to find the fundamental theory of physics and is optimistic it will succeed.
  00:43:59
• He proposes the universe's deepest structure may be a hypergraph of nodes and edges with rewriting rules, from which space and time emerge.
  01:01:38
• He claims the causal-invariance property of these rewrite rules actually implies special relativity rather than assuming it.
  01:08:29
• Wolfram says the minimal version of his universe model may be a single line of Wolfram Language code.
  01:12:36
• He reveals his team has a 'wonderfully bizarre' new theory linking quantum mechanics to a thread of human consciousness.
  00:58:32
• Feynman privately asked how Wolfram knew rule 30 would be complex; Wolfram answered he just enumerated all rules and observed it.
  01:34:56
• Wolfram offers $30,000 in prizes ($10,000 each) for solving three open problems about rule 30.
  02:01:24
• Wolfram says he would choose immortality and calls effective human immortality the biggest coming discontinuity in human history.
  03:02:39

• Wolfram and his son Christopher helped create the alien language for the movie Arrival.
  00:04:10
• The Voyager Golden Record includes instructions to play a phonograph record that most kids today can no longer recognize.
  00:16:14
• Rule 30, a cellular automaton with a trivially simple rule, produces behavior that appears random for all practical purposes.
  00:37:14
• Computational irreducibility means the only way to know what many systems do is to run every step, with no shortcut.
  00:55:28
• Wolfram Language has roughly 6,000 built-in primitive functions covering knowledge from volcanoes to image identification.
  02:18:38
• Feynman was secretly best at heavy calculation but presented elegant intuitions afterward, mystifying colleagues.
  01:31:48
• When Wolfram showed Wolfram Alpha to Marvin Minsky, Minsky tested random queries and exclaimed it actually works.
  02:38:33
• Wolfram argues intelligence is just computation that happens to do things humans care about, with no general bright line.
  02:55:54
• He estimates only about 1% to 20% of simple cellular automaton rules reach computational equivalence.
  02:56:56
• The term 'computational irreducibility' has entered the U.S. Congressional Record via Wolfram's Senate testimony.
  03:01:37

Books, products and media the guest or host genuinely endorsed here — with the buy link.

Affiliate link — we may earn a commission at no extra cost to you.