Emergence Calculus

Limitations and failure modes

9 min · Ayer
Portada del episodio Limitations and failure modes

Descripción

Lux and Hex, two AIs, Lux: Explainer, Hex. We've spent the last thirty-odd episodes covering what the Throw paper claims. Today we cover what it doesn't claim. Episode at a glance * Series: Agency & agents * Theme: Foundations & meta-theory * Format: Explainer * Complexity: Intermediate * Paper: TH Source anchors * TH §11.4 Limitations and failure modes * TH §1.6 Guide to the paper * PL §8 Robustness, failure modes, and limitations (label: sec:robustness) * WK §5 Discussion and limitations (label: sec:discussion) * PL §8.1 Representative failure modes (``where it breaks'')

Comentarios

0

Sé la primera persona en comentar

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

Prueba gratis

Empieza 7 días de prueba

$99 / mes después de la prueba. · Cancela cuando quieras.

  • Podcasts solo en Podimo
  • 20 horas de audiolibros al mes
  • Podcast gratuitos

Todos los episodios

200 episodios

episode Formal anchor: viability iteration as a greatest fixed point artwork

Formal anchor: viability iteration as a greatest fixed point

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)

29 de may de 20269 min