Machine Learning Street Talk (MLST) cover image

The Day AI Solves My Puzzles Is The Day I Worry (Prof. Cristopher Moore)

Machine Learning Street Talk (MLST)

00:00

Irreducibility Requires Universal Constructions

  • Computational irreducibility means some systems must be simulated step-by-step; proving this usually requires showing they can emulate computation.
  • Moore notes many natural systems look irreducible but we lack constructions to prove universality in them.
Transcript
Play full episode

The AI-powered Podcast Player

Save insights by tapping your headphones, chat with episodes, discover the best highlights - and more!
App store bannerPlay store banner
Get the app