Games between Programs: The Ruliology of Competition
Summary
Stephen Wolfram's piece surveys how simple computational strategies (finite state machines, cellular automata, Turing machines) compete in iterated games, revealing when simple hacks beat complexity and when adaptive evolution yields more nuanced winners. It emphasizes computational irreducibility and the idea that winning strategies depend on the opponent, with extensive visualizations and cross-style comparisons across game types.