# Abstract: Step Theory
## Computing the Information Geometry of Action

Traditional physical frameworks are bifurcated: **Noether’s Theorem** (1918) elegantly describes the "statics" of conservation through continuous symmetry, while classical thermodynamics describes the "decay" of systems through entropy. **Step Theory** provides the missing link, formalizing the "dynamics" of physical computation. It posits that the universe does not merely flow; it **resolves** through a series of discrete, irreversible events termed **Steps**.

The core of Step Theory is a functional dual to Noether’s Theorem: 

> **For every dissipation, there is a Step—a discrete symmetry breaking that computes a geodesic in its conjugate field.**

### 1. The Paradigm Step: Light as Computation
In Step Theory, there are no "photons" in the sense of traveling particles; there is only the bidirectional propagation of constraint. What we call light is a computation—a forward-backward algorithm where constraints propagate across available gradients and close only where mutual consistency is achieved. The admissible geometry of this propagation is fixed by the constitutive structure of spacetime (the permittivity and permeability tensor), which sets the resonant impedance for closure ($c = 1/\sqrt{\epsilon_0\mu_0}$). The universe tunes itself to a critical regime—an edge of chaos—where this bidirectional computation is possible; outside this regime, closure, memory, and path formation fail.



### 2. Mechanism: Off-Diagonal Coupling and Criticality
Unlike standard dissipation, which describes a single field relaxing toward equilibrium (the diagonal), Step Theory focuses on **Onsager cross-coupling**. A continuous gradient in an **Intensive Field** (Field A) drives a structural resolution in its **Conjugate Field** (Field B). The "Information Geometry" refers to the **Fisher Information Metric** applied to the manifold of possible action paths; a Step is the discrete collapse of probability space into the certainty of a recorded path.

Computation requires a specific phase state: **Order freezes. Disorder fragments. Chaos computes.** At the sub-critical interior, the system is too ordered to explore; in the supra-critical regime, it is too disordered to select. At criticality—the edge of chaos—the system initiates a **Bidirectional Handshake**:
* **The Question:** A forward-propagating wave probes the potential field.
* **The Closure:** A backward-propagating "return stroke" from the environment (the absorber) completes the circuit. 
* **The Commit:** This transaction is binary. Only upon closure is symmetry broken, energy dissipated, and the Step recorded.



### 3. Entrainment and Agent Emergence
Step Theory moves beyond single events through **Entrainment**. Discrete Steps entrain into cycles; these cycles couple through mutual dissipation into **Gaits** (functional architectures). This hierarchical coupling is the physical origin of **Agency**. For Agent-Based Modeling (ABM), this provides a scale-invariant foundation: agents are not predefined entities but emergent "limit cycles" of entrained transactions. By aligning transactions rather than spatial grids, Step Theory allows for the seamless fusion of models across disparate dimensions and temporal scales.



---

### Implementation: The Handshake Algorithm
* **Inquiry (Field A):** The agent monitors the intensive gradient threshold (e.g., electrical potential).
* **Transaction (Field B):** The agent probes for a resonant return signal (e.g., in a fire-spread model, the fuel-moisture gradient confirming ignition viability).
* **Settlement (The Step):** Upon closure, the agent "clicks" to the next state, dissipating the "cost" and updating the local Information Geometry.