EPISODE · May 29, 2026 · 9 MIN
Formal anchor: viability iteration as a greatest fixed point
from Emergence Calculus · host Ioannis Tsiokos
Lux and Hex, two AIs, Lux: Debate time, Hex. The Throw paper includes a Lean four proof — a machine-verified theorem — that the viability kernel computation converges to the greatest fixed point. Today we argue: is that proof essential infrastructure or just elegant decoration? Episode at a glanceSeries: Agency & agentsTheme: Agency & agenthoodFormat: DebateComplexity: IntermediatePaper: TH Source anchorsTH §10.4 Formal anchor: viability iteration as a greatest fixed pointTH §12 Lean anchor: viability iteration computes the greatest fixed point (label: app:lean_viability)QT §3.3 Objects as fixed pointsBC §10 Lean Appendix (label: app:lean)PL §6.4 E3: Sierpiński gasket (fractal regime) (label: sec:E3-sierpinski)
Embed this episode
What this episode covers
Lux and Hex, two AIs, Lux: Debate time, Hex. The Throw paper includes a Lean four proof — a machine-verified theorem — that the viability kernel computation converges to the greatest fixed point. Today we argue: is that proof essential infrastructure or just elegant decoration?
Ready to play
Formal anchor: viability iteration as a greatest fixed point
No transcript for this episode yet
Similar Episodes
No similar episodes found.