Emergence Calculus

Formal anchor: viability iteration as a greatest fixed point

9 min · 29 de may de 2026
Portada del episodio Formal anchor: viability iteration as a greatest fixed point

Descripción

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)

Comentarios

0

Sé la primera persona en comentar

¡Regístrate ahora y únete a la comunidad de Emergence Calculus!

Empezar

2 meses por 1 €

Después 4,99 € / mes · Cancela cuando quieras.

  • Podcasts exclusivos
  • 20 horas de audiolibros / mes
  • Podcast gratuitos

Todos los episodios

201 episodios