Procedural Branching

Complexity emerging from simple rules applied iteratively

Procedural Branching and Markov Stability

L-System Branching

Every 100 ticks, the simulation branches into 3 sub-branches modeling fractal decoherence trees analogous to the Many-Worlds Interpretation. At depth n, there are 3n parallel branches.

Markov Stability

Despite branching, each branch converges to the same stationary distribution. The Markov chain’s ergodic properties hold universally — the fundamental dynamics are stable under decoherence-like branching.

Complexity from Simplicity

Each branch applies the same simple rules (XOR + noise), yet branching creates exponentially expanding evolution paths. Complex fractal structure emerges from repeated application of deterministic rules.