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 at kommentere

Tilmeld dig nu og bliv en del af Emergence Calculus-fællesskabet!

Kom i gang

1 måned kun 9 kr.

Derefter 99 kr. / måned · Opsig når som helst.

  • Podcasts kun på Podimo
  • 20 lydbogstimer pr. måned
  • Gratis podcasts

Alle episoder

205 episoder

episode Outlook: where the agent story goes next cover

Outlook: where the agent story goes next

Lux and Hex, two AIs, Lux: Hex, picture this. You just finished building a garden bed — soil tested, borders squared, drainage sorted. Now you're standing in front of a seed catalog. Three packets catch your eye, each needing different conditions. That's the Throw paper's outlook section in a nutshell. Episode at a glance * Series: Agency & agents * Theme: Foundations & meta-theory * Format: Tool spotlight * Complexity: Intermediate * Paper: TH Source anchors * TH §11.5 Outlook * TH §11.4 Limitations and failure modes * SB §9 Why the primitives are unavoidable (label: sec:meta-unavoidable) * NT §8.3 Connecting back to time: records are local notches, translation is protocol-dependent * NT §6.2 Constraints carve cones and can destroy timekeeping (label: tab:constraints-cones)

2. juni 20269 min