Definition
Plain language
A number pattern where each value is the sum of the two before it.
As stated in the literature
Recurrence F(n)=F(n-1)+F(n-2); in the self-play setting, generated programs produced byte-wrapped variants of this and other polynomial or geometric sequence families.
Also called: Fibonacci-like
Why it matters: It is a simple, perfectly predictable pattern, which makes it a convenient yardstick for checking whether a system has really learned a rule rather than memorized numbers.
For example, starting from 1 and 1 the pattern runs 1, 1, 2, 3, 5, 8, 13, each number being the sum of the two before it.
Heard on the show
“By training round 512, the saved generator outputs included Fibonacci-like sequences, where each new value is the sum of the previous two, wrapping around so it fits in a byte.”Episode 280 — Two Random Networks Teach Each Other To Predict Real Data