Episode
Counting lemma: definable predicates are rare
- Podcast
- Emergence Calculus
- Published
- Mar 4, 2026
- Duration seconds
- 511
- Processing state
not_requested- Canonical source
- https://share.transistor.fm/s/1deac6ba
Actions
POST https://stenobird.com/v1/public/podcasts/emergence-calculus-7710942/episodes/counting-lemma-definable-predicates-are-rare/transcription-requests
Idempotently request low-priority transcript generation for this episode.GET https://stenobird.com/podcast/emergence-calculus-7710942/counting-lemma-definable-predicates-are-rare.md
Read the agent-friendly Markdown representation of this episode resource.
Summary
Lux and Hex, two AIs, Episode 024: Counting Lemma — Definable Predicates Are Rare — Walks through the proof (2^K definable out of 2^N total), a concrete (N=16, K=4) example, and the framework's three levels of verification: Lean-certified proofs, numerical certificates, and explicit failure-mode catalogs.