AIAny

Quantifying the Rise and Fall of Complexity in Closed Systems: The Coffee Automaton

Measures why complexity in closed systems rises then falls while entropy only climbs, using a coffee-and-cream cellular automaton. The key result: only interacting particles produce a transient complexity peak; non-interacting ones never do.

Introduction

Entropy in a closed system only ever goes up, yet the universe was structureless at the Big Bang and will be structureless again once everything disperses — so "interestingness" clearly behaves differently from entropy. This paper takes that vague intuition and tries to pin a number on it, asking a question most thermodynamics treatments dodge: what exactly rises and then falls as a system equilibrates?

Key Findings
  • Apparent complexity, defined operationally. The authors model mixing coffee and cream as a 2D cellular automaton and measure the Kolmogorov complexity of a coarse-grained (blurred) snapshot of its state — a quantity they name "apparent complexity," distinct from the entropy that just keeps climbing.
  • Interaction is the whole story. Analytically, non-interacting particles never reach high apparent complexity; the tendrils-and-swirls phase only appears when particles interact. Structure is not a free byproduct of mixing — it requires coupling.
  • A complexity bump, not a plateau. Numerically, the interacting system's apparent complexity peaks at a value comparable to the width of the "coffee cup" before collapsing as equilibrium arrives, reproducing the rise-and-fall curve the paper set out to capture.
  • An open challenge, stated honestly. Proving the observed peaking behavior analytically is left as an explicit open problem, not papered over.
How It Works

Coarse-graining is the conceptual pivot: at full resolution a mixed state is as random as an unmixed one, so complexity must be measured on a blurred view. That blurring is what makes "the cream is half-swirled" register as more complex than either pure separation or uniform brown — a small modeling choice that does most of the work.

Great Fit / When to Skip

Great fit if you care about defining and quantifying complexity, self-organization, or the arrow of time, and want a concrete toy model rather than hand-waving. Look elsewhere if you came for a finished theorem — the central behavior is shown numerically and posed as a conjecture, not proven — or if you expected a machine-learning method: despite living in an AI directory, this is a physics-and-information-theory paper at heart.

Information

  • Websitear5iv.labs.arxiv.org
  • OrganizationsMIT, Caltech
  • AuthorsScott Aaronson, Sean M. Carroll, Lauren Ouellette
  • Published date2014/05/27

More Items

Performs native structural reasoning for proteins, small molecules and inorganic crystals by tokenizing coordinates, topologies and periodic connectivities into a unified structure-aware vocabulary. Treats structural tokens as addressable evidence to produce interpretable prediction traces and improves accuracy across biology, chemistry and materials benchmarks.

A 2019 essay arguing that over 70 years of AI, general methods that scale with computation — search and learning — consistently beat hand-coded human knowledge. The short text that crystallized the scaling-vs-priors debate.

Proposes a router redesign for Mixture-of-Experts (MoE) that aligns each router row with its expert's principal singular direction using Manifold Power Iteration (MPI), improving token–expert affinity. MPI applies a 'power‑then‑retract' step to push router rows toward principal singular vectors while enforcing norm constraints; the paper gives convergence theory and pretraining results on 1B–11B MoE models.