Emergence Calculus

Lean anchor: viability iteration computes the greatest fixed point

8 min · 2. juni 2026
episode Lean anchor: viability iteration computes the greatest fixed point cover

Beskrivelse

Lux and Hex, two AIs, Lux: Hex, have you ever seen a surveyor's benchmark? Brass disc, hammered into bedrock. Buildings go up, buildings come down — the benchmark stays. Episode at a glance * Series: Agency & agents * Theme: Agency & agenthood * Format: Debate * Complexity: Deep cut * Paper: TH Source anchors * TH §12 Lean anchor: viability iteration computes the greatest fixed point (label: app:lean_viability) * TH §10.4 Formal anchor: viability iteration as a greatest fixed point * 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)

Kommentarer

0

Vær den første til å kommentere

Registrer deg nå og bli medlem av Emergence Calculus sitt community!

Prøv gratis

Prøv gratis i 14 dager

99 kr / Måned etter prøveperioden. · Avslutt når som helst.

  • Eksklusive podkaster
  • 20 timer lydbøker i måneden
  • Gratis podkaster

Alle episoder

210 Episoder

episode Spekkens' diagnosis and a Leibnizian layer principle cover

Spekkens' diagnosis and a Leibnizian layer principle

Lux and Hex, two AIs, Lux: Hex, imagine a translator's desk. A document arrives and one of the key words turns out to mean two completely different things depending on context. The translator's first job isn't to translate — it's to diagnose the ambiguity. Episode at a glance * Series: Quantum as packaging * Theme: Quantum & measurement * Format: Concept interview * Complexity: Intermediate * Paper: QT Source anchors * QT §2 Spekkens' diagnosis and a Leibnizian layer principle (label: sec:spekkens) * QT §1 Introduction * BC §4 Quantum → classical: closure as dephasing (label: sec:quantum-classical) * TH §3 The packaging engine: from kernels to induced agent variables (label: sec:engine) * BC §7.1 Scope: instantiations, not derivations

3. juni 20269 min