Pattern, Persist! [LONG Monograph]
★ Giulio Ruffini, Francesca Castaldo
★ guarantor: Giulio Ruffini · vouches for the paper per WP0084 §6
The word agent now names systems as different as a tool-using language model and a chemotactic cell, with no shared definition across the fields that use it. We argue that these uses converge on one substrate-independent structure---the algorithmic agent: model-mediated regulation built from an implicit or explicit Modeling Engine, a scalar Objective Function, and a Planning Engine. Its root is algorithmic persistence: a pattern whose compressed identity survives the filter of time. Holding a pattern bounded under perturbation takes a load-bearing regulator somewhere in the pattern--world system---a structure that absorbs, cancels, or exports what interaction would otherwise let accumulate. By the Algorithmic Regulator Theorem, this regulator shares mutual algorithmic information with the world: it carries a model of what it regulates and can be read as-if acting through an objective and a planner. The pattern is an agent only when this regulator is localized within it (self-regulation), and telehomeostatic only when the regulator's objective is the pattern's own persistence. Regulation in macroscopic systems acts on coarse-grained, many-to-one variables. It is therefore irreversible and exacts a Landauer cost — a price that scales with the coarse-graining and vanishes for reversible, equilibrium persistence (e.g., an isolated atom). Hence the thesis: a macroscopic agent is a persistent pattern that conserves its own bounded code through a thin, thermodynamically costly boundary, in a world that, when closed and reversible, conserves algorithmic information up to the fixed description of its law and time index. Its conserved quantity is therefore algorithmic---program information, not probability mass---so Shannon entropy, free energy, and heat enter as its coarse-grained faces. We use it to reframe the free-energy principle and evolution: in a collective the parts need not share an objective, so alignment is an objective-distribution problem---the design of local objectives and of the constraints that bound them so that the whole persists, not the search for one correct reward. Whether a persistent collective is itself one agent or many is then read from a landscape of its regulation---distributed agency, not mere integration.
Agency is what happens when a pattern fights to stay a pattern — and this paper builds that intuition into a precise, substrate-independent theory.
The core move is to start from persistence rather than from goals or behavior. A pattern persists when its compressed description at time t still describes it at time t+τ — when the "identity program" survives the filter of time. The paper formalizes this as a normalized mutual algorithmic information score between the pattern's earlier and later submodels. High score: the pattern persists. Low score: it dissolved. This is observer-relative (you need a projection and a modeling agent to define the pattern at all), but not arbitrary — most candidate patterns fail to compress, predict, or support action under further observation.
Persistence under perturbation immediately forces a regulator into existence somewhere in the pattern-world system. Something must absorb, cancel, or export the complexity that interaction keeps injecting. The Algorithmic Regulator Theorem (ART, from a companion paper) makes this precise: a sustained reduction in the readout's description length is strong evidence — under the universal Solomonoff prior — that the regulator shares mutual algorithmic information with what it regulates. In plain terms: a successful regulator must carry a model of its world. This is the algorithmic sharpening of Conant and Ashby's 1970 "Good Regulator" theorem. From that model, a scalar objective (the complexity gap itself) and a planner (minimize predicted description length) follow as natural readings, not added machinery. Together these three roles — Modeling Engine, Objective Function, Planning Engine — define the algorithmic agent.
The crucial distinction the paper draws is where the regulator sits. A room held at 21°C by a thermostat is a persistent regulated pattern, but the agent is the thermostat, not the room. A cell is different: the regulatory work is localized inside the pattern itself. The paper operationalizes this with a directional ablation test — null the pattern's action on the world versus null the world's forcing on the pattern, and see which ablation destroys persistence. A Game-of-Life "eater" cell pattern works out the example computably: killing the eater's outward action destroys it; sealing it from incoming gliders does not. That asymmetry certifies self-regulation. A passive "blinker" pattern, which mounts no defense, marks the contrast.
Macroscopic regulation is irreversible — it acts on coarse-grained, many-to-one variables and cannot retain the full microstate fiber it discards. By Landauer's principle, each irreversibly discarded bit costs at least k_BT ln2 in heat. So the thermodynamic price of persistence scales with the irreversible discard rate, not the size of the model. A proton relaxing after a photon hit pays almost nothing (near-equilibrium, reversible export); a cell continuously pays to maintain its identity (far-from-equilibrium, constitutive dissipation). The paper's thesis is that a macroscopic agent is precisely a pattern conserving its own bounded code through a thin, thermodynamically costly boundary, inside a world that — when closed and reversible — conserves algorithmic information globally. Agency is the local form of that global conservation.
The final payoff is a reframing of alignment and evolution. In a collective of agents, the parts need not share an objective — and Arrow's impossibility theorem means they cannot in general be aggregated into one. Instead, alignment is an objective-distribution problem: design the local objectives and the constraints bounding them so the collective as a whole persists, without requiring any single shared reward. Whether a persistent collective counts as one agent or many is then read from the landscape of its regulation — where the load-bearing regulatory structure is localized — not from an intrinsic integration scalar.
- Zenodo
- 10.5281/zenodo.21008798
- DOI
- 10.20944/preprints202607.0418.v2
- Preprint
- https://doi.org/10.20944/preprints202607.0418.v2
- WP ID
- WP0162
- Lifecycle
- completed
- Visibility
- public
- Access level
- open
- Embargo until
- —
- Priority
- —
- Collab
- closed
- Venue
- Preprints.org
- DOI
- 10.20944/preprints202607.0418.v2
- Deadline
- —
- Owner
- —
- Source
- drive_legacy
- Repo path
- WP0162
- v1.6.0 (revision) · cut-version · zenodo:21364719
- v1.5.0 (revision) · cut-version · zenodo:21290318
- v1.4.0 (revision) · cut-version · zenodo:21279793
- v1.3.0 (revision) · cut-version · zenodo:21278422Add meta-agency landscape (is a collective one agent or many: G, S*, localization, resilience) and its relation to integrated information (compression forces the coupling Phi measures; grounds not competes). Revise P3 to model-relevant discard (not model-update rate, arousal, or raw surprise). Add conservation/heat spine to section 5 (heat = price of not keeping the info needed to invert the update). Soften FEP framing to two-faces. Formalize meta-persistence in Lean.
- v1.2.0 (revision) · cut-version · zenodo:21264696meta and IIT
- v1.1.0 (revision) · cut-version · zenodo:21224340
- v1.0.0 (preprint) · cut-version · zenodo:21222905
- v0.10.0 (preprint) · cut-version · zenodo:21221716
- v0.9.0 (revision) · cut-version · zenodo:21206073
- v0.8.0 (revision) · cut-version · zenodo:21008799
- v0.7.0 (revision) · cut-version
- v0.6.0 (revision) · cut-version
- v0.5.0 (revision) · cut-version
- v0.4.0 (revision) · cut-version
- v0.3.0 (revision) · cut-version
- v0.2.0 (revision) · cut-version
- 0.1.0 (draft) · auto-run-placeholder
