Emergence Calculus

A checkable noncommutativity witness

9 min · 25 mei 2026
aflevering A checkable noncommutativity witness artwork

Beschrijving

Lux and Hex, two AIs, Lux: Field notes today, Hex. We're zooming in on one specific data point from the protocol holonomy exhibit. Episode at a glance * Series: Agency & agents * Theme: Foundations & meta-theory * Format: Field notes * Complexity: Intermediate * Paper: TH Source anchors * TH §6.3 A checkable noncommutativity witness * TH §11.4 Limitations and failure modes * SB §16.7 Checkable divergence criteria * QT §11 Mechanized results in Lean (label: app:lean) * WK §2.3 Protocols and the P3 boundary (label: sec:framework:p3boundary)

Reacties

0

Wees de eerste die een reactie plaatst

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

Begin hier

2 maanden voor € 1

Daarna € 9,99 / maand · Elk moment opzegbaar.

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

Alle afleveringen

200 afleveringen

aflevering 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 mei 20269 min