1. Brownian Motion & Large Numbers
Stochastic kicks dx = √(2D dt)·N(0,1). Individual grains wander; the ensemble center of mass locks near zero.
Paths xi(t)
±√(2Dt)
Mean x̄(t)
t = 0.00
Single RMS √〈x²〉
Mean error |x̄(t)|
1 / √N smoothing
Ensemble Size (N)
120
Diffusivity (D)
1.00
Single RMS
0.00
Mean |x̄(t)|
0.000
1 / √N Factor
0.091×
2. Deterministic Chaos (Lorenz)
Zero noise: exact RK4 integration of twin trajectories separated at t = 0 by tiny sensor error δ0.
State A (x0)
State B (x0 + δ0)
Attractor (x, z)
log10 ||δ(t)||
Slope λ ≈ 0.91
Lyapunov horizon
Initial Error (δ0)
10⁻⁵
Rayleigh (ρ)
28.0
Separation ||δ||
0.00001
log10 ||δ||
-5.00
Horizon tH
~15.5 s
3. Computational Irreducibility (CA)
Exact integer bits (δ0 = 0) and zero noise, yet Rule 30 admits no shortcut faster than running every row.
Center c(t)
1-bit flip XOR cone
row t = 0
Center 4-bit Shannon entropy H4/4
Ones density
Max randomness = 1.00 bit
Active Rule
Rule 30
Center Entropy
0.00 b
Ones Ratio
100%