Concept
Universality
The property of a system able to simulate any computation whatever, and therefore as powerful as any computer.
Named by 2 essays across one field — each of them below, with the objects they name alongside it.
A constant that does not care which map
The gaps between successive period doublings shrink by a factor. Measure that factor for the logistic map and you get 4.669. Measure it for a completely different map and you get 4.669, and nobody expected that.
The rule that computes
One of the 256 elementary rules can run any program. Not simulate one, not approximate one — a machine that can compute anything computable, built from a lookup table with eight rows and nothing else.
Named alongside it
The objects these essays reach for when they reach for this one.
BifurcationCellular automatonComputationConvergenceFeigenbaum constantGliderHalting problemIterationLocalityLogistic mapPeriod doublingRenormalisation