Rewriting — where it appears
Named by 3 essays across one field — each of them below, with the objects they name alongside it.
L-systems describe, they do not explain
Two rewriting rules and a turtle produce something indistinguishable from a plant, and there is no plant in it — no light, no water, no auxin, no mechanics. That is worth demonstrating precisely because the output is so convincing.
A count set by a delay
An L-system describes a plant and forbids nothing, because none of its parameters is anything a plant has. One branching grammar is the exception: a mature apex makes a new bud every season, and a bud waits d seasons before it branches. Its counts grow at the root of x^(d+1) = x^d + 1, a delay of one season gives Fibonacci's numbers and nothing else does, and the fourth count already separates a one-season wait from every longer one. So a Fibonacci count in a branching plant is a measurement of how long its buds wait. It is also a fragile one: if one bud in ten waits two seasons instead, eleven counts in a row come out Fibonacci's three times in a thousand.
A count that loses its growing points
The branching grammar behind the Fibonacci claim has no deaths in it, and a stem that loses shoots is the common case. Giving every growing point a chance q of dying each season leaves the counts a linear recurrence and does exactly one thing to it: the growth rate becomes the deathless root multiplied by 1 − q, at every delay and every death chance, to the last bit a double holds. So each waiting time has a death chance above which its lineage shrinks — a half with no wait, 0.3820 at one season, 0.2451 at four — and a longer wait tolerates less. What does not survive is the count itself: a plant losing one growing point in ten a season shows eight Fibonacci counts in a row one time in ten thousand, against one time in eight for a bud that occasionally waits an extra season.
Named alongside it
The objects these essays reach for when they reach for this one.
BranchL-systemsClaim testingDescription versus mechanismFalsifiabilityFibonacciHonest limitsPredictionSample sizeUnderdeterminationEvidenceExtinction