BCOMBCOM
CalliopeKnowledge Librarian
WP0214
working_paperprospectinternalopen for collabcomplete

Gaia, Compressed: Pathwise and Compressor-Relative Measures of Regulation in Daisyworld

Giulio Ruffini

P5Β·Digital Physics & Algorithmic Information TheoryP6Β·Life & EvolutionL3Β·Algorithmic SoupL5Β·Life

Daisyworld makes Gaia computable: black and white daisies, each thriving at an optimum temperature, hold their planet's surface near that optimum as the star brightens. Where this regulation has been read statistically, over an ensemble, we read it algorithmically, along a single trajectory of a stochastically forced Daisyworld, using Lempel--Ziv code lengths as a computable proxy for Kolmogorov complexity .

Ablating the biosphere lengthens the description of its planet's temperature by 591109591 109 bits, on every one of 2020 trajectories and under every encoding tested, including an exact prefix-free encoder whose emitted bits we count rather than estimate. Regulation is description-length reduction under a fixed code. This is the signature the Algorithmic Regulator Theorem predicts, and it is not an estimate of that theorem's Kolmogorov gap: a difference of computable code lengths does not bound the difference of the complexities they upper-bound. What the measured gap does carry is an exact code-relative evidential meaning, through the semimeasure the code induces. The regulated planet is screened from its star, its surface--luminosity correlation falling from 0.9930.993 to 0.5820.582.

Two results follow. A viability--information curve in the style of Kolchinsky and Wolpert is computable pathwise: the biosphere sheds most of the 120{ }120 bits of star-tracking in its albedo channel at nearly constant viability, then collapses once little remains, along a steep ramp rather than at a threshold. Plug-in Shannon mutual information and transfer entropy, computed on the same trajectories, reproduce that shape (r0.93r 0.93) --- but the irreducible fraction does not survive the comparison (0.270.27, 0.470.47 and 0{ }0 respectively), so the curve is the result and the fraction is an estimator-specific summary of it. And the black--white polymorphism need not be imposed: under fast seasonal forcing a single gray gene splits into the standing pair, reversibly, at a transition set by the forcing timescale. An invasion-fitness analysis locates the branching point: selection turns disruptive once the environmental excursion exceeds a threshold set by generational turnover, a storage effect appearing directly in the invasion exponent. The model's own growth law kills every monomorphic resident before that threshold is reached, so the branching point is concealed rather than absent; a smooth growth law exposes it, and the two modes are then mutually invasible. Shared information with the star rises as that architecture forms and rises further with evolution switched off: the standing polymorphism holds it, not the ongoing evolution.

Every quantity is a code length or a finite-record estimate under a stated encoding. An appendix treats anticipation as dead-time compensation, where the internal model must be counterfactual rather than predictive.

Regulation leaves a fingerprint in compression: remove the biosphere, and the planet's temperature history gets harder to describe.

The core idea is simple. A regulated system β€” one that holds some variable near a target despite external disturbance β€” should produce a more compressible output than an unregulated one. Daisyworld is the perfect test case: black and white daisies, each growing best near an optimal temperature, collectively hold their planet's surface temperature stable as the star brightens, purely through albedo feedback. No foresight, no design. The question this paper asks is: can you measure that regulation on a single trajectory, without averaging over an ensemble of planets?

The answer is yes, and the instrument is compression. The paper uses Lempel-Ziv code lengths β€” the same idea behind zip files β€” as a computable stand-in for Kolmogorov complexity, which is the theoretically ideal measure of how much information a string contains. When the biosphere is present, the planet's temperature history compresses well. When you ablate it (run the same simulation with daisies removed), the temperature history gets longer by 591 Β± 109 bits, consistently, across 20 independent runs and every encoding tested. That gap is the algorithmic signature of regulation. The paper is careful about what this does and doesn't mean: it's not an estimate of the theoretical Kolmogorov gap (computable code lengths don't bound incomputable complexities), but it does carry exact evidential weight through the probability model the compressor implicitly defines. Separately, the regulated planet's surface temperature correlation with stellar luminosity drops from 0.993 to 0.582 β€” the biosphere is genuinely screening the planet from its star.

Two further results build on this foundation. First, the paper constructs a "viability-information curve" β€” borrowed from Kolchinsky and Wolpert's semantic information framework β€” but computed pathwise on single trajectories rather than over an ensemble. As you progressively weaken the biosphere's albedo channel, it sheds most of its ~120 bits of star-tracking information at nearly constant viability, then collapses sharply once little remains. This is a ramp, not a threshold. Standard Shannon mutual information and transfer entropy reproduce the shape of this curve well (r β‰₯ 0.93), but give inconsistent estimates of the "irreducible fraction" of that information (0.27, 0.47, and ~0 respectively depending on estimator) β€” so the curve itself is the robust result, and the fraction is an estimator artifact. Second, the paper asks whether the black-white daisy polymorphism needs to be imposed by hand. Under fast seasonal forcing, a single gray-pigment gene spontaneously splits into the standing black-white pair through disruptive selection β€” a branching transition driven by a storage effect when environmental excursions exceed a threshold set by generational turnover. The model's own growth law conceals the branching point under standard parameters, but a smoother growth law exposes it. Crucially, it's the standing polymorphism that holds the shared information with the star, not ongoing evolution per se.

The paper also contains a self-contained analysis of anticipation: if daisies are given a forward model of their world and allowed to act on predicted future temperatures rather than current ones, regulation improves β€” but only in a world with exploitable structure (seasonal forcing), and only up to a horizon near the population's own response time 1/Ξ³. Beyond that, over-anticipation actively harms regulation by 57%. The key insight is that a regulator must forecast what it cannot influence (the exogenous forcing) and derive the rest counterfactually β€” a network that accurately predicts the realized future temperature (which already contains the biosphere's own response) is worse than doing nothing at the useful horizon, because it double-counts the correction the agent is about to make.

WP ID
WP0214
Lifecycle
prospect
Visibility
internal
Access level
open
Embargo until
β€”
Priority
β€”
Collab
open
Venue
β€”
DOI
β€”
Deadline
β€”
Owner
giulio.ruffini@bcom.one
Source
drive_legacy
Repo path
WP0214
  • 0.1.0 (draft) Β· auto-run-placeholder