GRAIN: 4. THE BOUNDED CHAOS THEOREM
The Claim
A quantifiable zone maximizes complexity, computation, and adaptability.
Definitions
regime: system behavior over time. C(R): Imax(R) times chi(R) times Cinfo(R) over H(R) plus epsilon. Imax(R): mutual information. chi(R): susceptibility. Cinfo(R): computational capability. H(R): entropy. epsilon: small positive constant. Rc: critical regime. criticality: state at Rc. critical seam: zone between frozen order and chaotic disorder. computational capability: computational power. information storage: stored information. dynamic range: signal ratio.
The Logic
- 1 IF system at Rc, THEN Imax peaks.
- 2 IF system at Rc, THEN chi diverges.
- 3 IF system at Rc, THEN Cinfo peaks.
- 4 IF H suppresses noise, THEN C(R) avoids randomness.
- 5 IF Imax peaks and chi diverges and Cinfo peaks, THEN C(R) rises.
- 6 IF C(R) rises and avoids randomness, THEN C(R) maximizes at Rc.
- 7 IF peak has finite width, THEN near-criticality suffices.
The Evidence
- Systems at criticality show maximal sensitivity to relevant inputs.
- Systems at criticality show maximal insensitivity to irrelevant noise.
- Systems at criticality show maximal information storage.
- Systems at criticality show maximal computational capability.
- Systems at criticality show maximal dynamic range.
The Falsifier
- C(R) has no global maximum.
- Maximum does not occur at Rc.
- No real system operates in critical seam.
The Uncertainty
No one has measured exact width of critical seam for specific systems. Status: open.
Ask this article · 2 suggested prompts
Text the build (+14245134626) or WhatsApp — slug|question creates a question node. Paste evidence with ingest slug|q:NODE_ID|your paste.