Emergence Calculus

Formal anchor: viability iteration as a greatest fixed point

9 min · 29 mei 2026
aflevering Formal anchor: viability iteration as a greatest fixed point artwork

Beschrijving

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 glance * Series: Agency & agents * Theme: Agency & agenthood * Format: Debate * Complexity: Intermediate * Paper: TH Source anchors * TH §10.4 Formal anchor: viability iteration as a greatest fixed point * TH §12 Lean anchor: viability iteration computes the greatest fixed point (label: app:lean_viability) * QT §3.3 Objects as fixed points * BC §10 Lean Appendix (label: app:lean) * PL §6.4 E3: Sierpiński gasket (fractal regime) (label: sec:E3-sierpinski)

Reacties

0

Wees de eerste die een reactie plaatst

Meld je nu aan en word lid van de Emergence Calculus community!

Probeer gratis

Probeer 14 dagen gratis

€ 9,99 / maand na proefperiode. · Elk moment opzegbaar.

  • Podcasts die je alleen op Podimo hoort
  • 20 uur luisterboeken / maand
  • Gratis podcasts

Alle afleveringen

202 afleveringen