How simple rules and aggregation produce complex emergent behavior: Central Limit Theorem, Conway's Game of Life, Wolfram's Cellular Automata, and the Condorcet Paradox in preference aggregation.
Sample from any distribution, compute the mean of each sample, and watch the distribution of means converge to a normal (bell) curve regardless of the source distribution.
Regardless of the underlying distribution -- uniform, exponential, bimodal, or anything else -- the average of many independent random variables approaches a normal distribution. This is the Central Limit Theorem. As sample size N increases, the distribution of sample means becomes increasingly bell-shaped and tighter around the true mean. The standard deviation of means shrinks proportionally to 1/sqrt(N).
The bell curve is not an assumption about how the world works -- it is a mathematical consequence of aggregation. Whenever you see a normally-distributed outcome, ask: "What independent factors are being summed here?" The CLT explains why so many phenomena in nature and society follow this pattern.
Cells on a grid live, die, or are born based on four simple rules. From these emerge gliders, oscillators, spaceships, and even structures capable of universal computation.
Click on the grid to draw/erase cells.
Just four simple rules: (1) Any live cell with fewer than 2 live neighbors dies (underpopulation). (2) Any live cell with 2 or 3 live neighbors survives. (3) Any live cell with more than 3 live neighbors dies (overcrowding). (4) Any dead cell with exactly 3 live neighbors becomes alive (reproduction). From these emerge gliders (moving patterns), oscillators (repeating patterns), spaceships, and even universal computation. Simple rules produce complex emergent behavior.
The Game of Life demonstrates that complexity does not require complex rules. The whole performs functions that far exceed the capacities of its parts. This raises deep questions: if consciousness and intelligence can emerge from simple neuronal rules, could complex social phenomena similarly emerge from simple individual behaviors?
A single row of cells evolves according to a rule that maps each 3-cell neighborhood to a new state. All 256 possible rules are encoded in a single byte, yet they produce behaviors ranging from uniform to chaotic to complex.
Each cell looks at itself and its two neighbors (3 cells = 8 possible patterns). The rule number, converted to binary, tells each pattern whether the center cell should be alive or dead in the next generation. A single byte (0-255) completely determines the behavior. Wolfram classified outcomes into four classes: Class 1 (uniform/empty), Class 2 (periodic/repetitive), Class 3 (chaotic/random), and Class 4 (complex). Rule 110 is provably Turing complete -- it can compute anything a computer can.
A single number between 0 and 255 can specify behavior ranging from trivially empty to capable of universal computation. This suggests that the boundary between simplicity and complexity is razor-thin, and that immense computational power can hide in extremely simple systems.
Different voting methods applied to the same set of voter preferences can produce different winners. Arrow's Impossibility Theorem proves no ranked voting system can satisfy all fairness criteria simultaneously.
With three or more candidates, individual rational preferences can produce irrational group outcomes. The Condorcet Paradox: A beats B, B beats C, but C beats A -- a cycle with no clear winner. Different aggregation methods break this cycle differently: Plurality picks the most first-place votes, Borda Count scores all rankings, Condorcet checks head-to-head matchups, and Runoff eliminates the weakest candidates. Arrow's Impossibility Theorem proves that no ranked-choice voting system can simultaneously satisfy all fairness criteria (non-dictatorship, Pareto efficiency, independence of irrelevant alternatives).
There is no perfect voting system. The method of aggregation is not a neutral procedure -- it actively shapes the outcome. This means the choice of how to choose is itself a consequential decision. In any group decision with 3+ options, someone must decide the rules, and the rules partly determine the winner.