What does The Sandbox, Determinism and Active Inference conclude, in numbers, about “Determinism, Chaos and Agency”?
Answer: The separation of the two trajectories grows by a factor of about \(e{0.92} \approx 2.5\) per time unit. The program's estimate of the largest Lyapunov exponent, about 0.92, is close to the commonly quoted value of about 0.906. This gives a predictability horizon: an initial error of \(10{-9}\) grows to the size of the attractor in about 23 time units, an error of \(10^{-3}\) in only about 7.5. Each thousandfold improvement in initial measurement adds only about 7.5 time units of prediction: better precision buys only a linear extension of foresight.
Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (15 programs, all checked), classical sources and the author's hypotheses. This book is not psychotherapy or diagnosis; its account of old priors driving repeated setbacks is a hypothesis and a cross-disciplinary analogy and never implies that victims are responsible for what happened to them.
Data table
The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 10, 7.5
time | separation of the two runs 5 | 6.16e-09 10 | 2.70e-07 15 | 2.47e-05 20 | 1.44e-03 25 | 4.96e-02 30 | 1.02e+01 35 | 2.14e+01 40 | 8.30e+00 largest Lyapunov exponent ~ 0.917 per unit time initial error 1e-09: grows to size 1 after about 22.6 time units initial error 1e-06: grows to size 1 after about 15.1 time units initial error 1e-03: grows to size 1 after about 7.5 time units
Key formula
Show the full program
# The Lorenz (1963) system, sigma = 10, rho = 28, beta = 8/3, integrated with fourth-order Runge-Kutta.
# Two runs start 1e-9 apart. Their separation grows roughly as exp(lambda t); lambda (the largest
# Lyapunov exponent) is estimated by repeatedly renormalising a nearby trajectory (Benettin's method).
import math
S, R, B = 10.0, 28.0, 8.0 / 3.0
def deriv(p):
x, y, z = p
return (S * (y - x), x * (R - z) - y, x * y - B * z)
def rk4(p, h):
k1 = deriv(p)
k2 = deriv([p[i] + h / 2 * k1[i] for i in range(3)])
k3 = deriv([p[i] + h / 2 * k2[i] for i in range(3)])
k4 = deriv([p[i] + h * k3[i] for i in range(3)])
return [p[i] + h / 6 * (k1[i] + 2 * k2[i] + 2 * k3[i] + k4[i]) for i in range(3)]
def dist(p, q):
return math.sqrt(sum((a - b) ** 2 for a, b in zip(p, q)))
H = 0.01
a = [1.0, 1.0, 20.0]
for _ in range(2000): # settle onto the attractor
a = rk4(a, H)
b = [a[0] + 1e-9, a[1], a[2]]
print("time | separation of the two runs")
for step in range(1, 4001):
a, b = rk4(a, H), rk4(b, H)
if step % 500 == 0:
print(f"{step * H:4.0f} | {dist(a, b):.2e}")
p = a[:]; q = [p[0] + 1e-8, p[1], p[2]]; total = 0.0; T = 0
for step in range(1, 100001):
p, q = rk4(p, H), rk4(q, H)
if step % 10 == 0:
d = dist(p, q); total += math.log(d / 1e-8); T += 10 * H
q = [p[i] + (q[i] - p[i]) * 1e-8 / d for i in range(3)]
lam = total / T
print(f"largest Lyapunov exponent ~ {lam:.3f} per unit time")
for err in (1e-9, 1e-6, 1e-3):
print(f"initial error {err:.0e}: grows to size 1 after about {math.log(1 / err) / lam:4.1f} time units")Single source and citation
Fan, Y. (2026). The Sandbox, Determinism and Active Inference (Version 1.0.0), Chapter 6: Determinism, Chaos and Agency. 5D Library. https://doi.org/10.5281/zenodo.23738794
DOI: 10.5281/zenodo.23738794 · Read the monograph · 5DL-B-015 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026015,
author = {Fan, Yafu},
title = {The Sandbox, Determinism and Active Inference},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23738794},
url = {https://doi.org/10.5281/zenodo.23738794}
}Other chapter answers in this book
- Chapter 1 · The Bayesian Brain and the Self-Fulfilling Prophecy
- Chapter 2 · Two Routes: Change the Mind, or Change the World
- Chapter 3 · Markov Blankets and the Boundary of the Individual
- Chapter 4 · Escaping the Local Optimum: Exploration and Exploitation
- Chapter 5 · Structured Sandboxes and the Reshaping of Priors
- Chapter 8 · Practice and a Pre-Registered Trial