Branch thickness represents slack—many micro-paths to same macro-outcome
Position in locality-regularity vs policy-richness plane
Weighted combination: 25% branching + 25% empowerment + 20% volume + 20% emergence + 10% regularity
Even with a fixed algorithm, branching and choice exist. The conditional action entropy measures how many nontrivial options the system has at each step. Combined with empowerment—the mutual information between actions and future states—this captures meaningful choices rather than mere noise.
The policy manifold volume represents how many distinct algorithms (policies) the system can reach through learning, plasticity, or reconfiguration within timescale τ. A sorting algorithm has near-zero volume; a learning organism inhabits a vast, structured region of policy space.
When macro-level descriptions have more effective information than micro-level ones, we have causal emergence: . This is where high-level decisions become better levers on system behavior than raw micro-variables—the mathematical signature of genuine agency at scale.
The Bernshteyn–Rozhoň bridge connects local distributed algorithms to measurable colorings on infinite Borel graphs. High descriptive regularity means solutions are tame (Borel/Baire measurable) and locally implementable—not pathological axiom-of-choice constructions that cannot be realized by physical systems.
The visualization shows algorithms as trees—computation unfolding through time—with a translucent cloth representing goal slack: the fiber bundle of micro-implementations that achieve the same macro-outcome. Thick cloth means many paths to the same goal; thin cloth means rigid, deterministic execution. This is freedom made geometric.
The freedom score combines these dimensions:
Low scores indicate rigid automata with tiny policy manifolds. High scores correspond to systems that navigate policy space itself, exploiting slack between implementations and using macro-scale descriptions as powerful levers on their own dynamics.