Thousands of cells. Three operations. Zero intelligence coded. Each cell is a 3-bit pattern (0-7). Every generation: neighbors vote via 3-voter majority, cells metabolize, and dying cells pass their pattern to neighbors. Pattern 7 (all bits on) emerges from random noise and sweeps the field.
Three Operations
The 3-Voter Substrate
Only three binary operations are needed: AND (preserve), XOR (split), MAJ (decide). AND preserves. XOR distinguishes. MAJ decides. Every Boolean function can be built from these three. 3 voters is the minimum for a decisive majority.
Operation
What it does
Formula
AND
Persistence. What survives AND survives.
a AND b
XOR
Distinction. Parity.
a XOR b
MAJ
Majority decision. Minimum 3 voters.
MAJ(a,b,c)
Pattern 7
All bits on = maximum complexity (111 in binary).
a=b=c=1
Emergence Mechanics
From random initial conditions on a 2D grid, STRUCTURE EMERGES:
Pattern 7 dominates
All bits on
The 111 state is the most stable. It wins the majority vote against any two opponents. Pattern 7 emerges because it persists under MAJ.
Level ascension
L0 -> L7
Stable cells ascend through 7 levels. Each level increases resilience. Growth requires sustained stability.
Pattern transfer
Dying -> neighbor
When a cell dies (energy depleted), it gives its pattern to a random neighbor. Death creates structure.
Accumulated resistance
Prediction + memory
Cells that survive many generations accumulate resistance to harmful mutations. Not coded. Emergent from the energy rules.
Periodic stress
Every 3 generations
Environmental perturbation. Tests resilience. High-level cells survive; low-level cells may die. Period-3 is structural.
Why Three
Minimum Decisive Majority
You need at least 3 voters for a decisive majority (2 vs 1). With 2: ties. With 1: dictatorship. 3 is the minimum for MAJ to be non-trivial. The algebraic fact: -2*cos(pi/q) is uniquely minimized at q = 3.
Boolean Completeness
AND + XOR + MAJ = functionally complete. Any Boolean function can be expressed as a composition of these three. AND preserves. XOR distinguishes. MAJ decides. Three operations suffice for universal computation -- and three is the minimum.
How This Compares
Property
This CA
Conway GoL
Tierra/Avida
Operations
3 (AND, XOR, MAJ)
1 (neighbor count)
~26 instructions
Cell state
3 bits (0-7)
1 bit
~100 bytes
Self-model
Yes (prediction)
No
No
Pattern transfer
Emergent from energy
N/A
N/A
Leveling
7 levels
None
None
Interaction
Paint cells
Toggle cells
None
Explore: 3-Voter Majority
Enter three bits (0 or 1). See AND, XOR, MAJ. Pattern 7 = all three outputs = 1. Try 1,1,1 then 1,1,0 then 0,0,0.
Three inputs (a, b, c):
Contrast Table
Aspect
Standard View
Ring Structure View
Cellular automaton
Model of computation
AND, XOR, MAJ produce pattern 7 from noise
Majority rule
Voting mechanism
3-voter majority = minimum for decisive vote. Algebraically forced.
Emergence
Complex from simple
Pattern 7 (all bits on) dominates. Stability from three operations.
Pattern 7
Arbitrary stable pattern
111 in binary. Wins MAJ against any 2 opponents.
Pattern transfer
Not modeled
Dying cells pass patterns to neighbors. Death creates structure.
Three operations
Design choice
AND + XOR + MAJ = functionally complete. Minimum set.