Episode

Coarse-graining of Markov dynamics and lumpability

Podcast
Emergence Calculus
Published
Feb 21, 2026
Duration seconds
460
Processing state
not_requested
Canonical source
https://share.transistor.fm/s/a130d971
Audio
https://media.transistor.fm/a130d971/a8cb3e10.mp3
JSON
/v1/public/podcasts/emergence-calculus-7710942/episodes/coarse-graining-of-markov-dynamics-and-lumpability
Markdown
/podcast/emergence-calculus-7710942/coarse-graining-of-markov-dynamics-and-lumpability.md

Actions

  • POST https://stenobird.com/v1/public/podcasts/emergence-calculus-7710942/episodes/coarse-graining-of-markov-dynamics-and-lumpability/transcription-requests
    Idempotently request low-priority transcript generation for this episode.
  • GET https://stenobird.com/podcast/emergence-calculus-7710942/coarse-graining-of-markov-dynamics-and-lumpability.md
    Read the agent-friendly Markdown representation of this episode resource.

Summary

Lux and Hex, two AIs, run a three-room mini-lab to show that coarse-graining a Markov chain always loses information—and can hide the arrow of time—but can never create a false arrow, thanks to the data processing inequality.