Back matter
Glossary
609 terms defined in Binary Pulse Theory, read from the text itself. 337 carry a definition from the lexicon.
Chapter 7 2
Computational Load Accumulation
Process whereby recursive systems must process all previous computational states creating quadratic growth L(n) = n(n+1)/2 in processing requirements and driving complexity scaling.
L(n) = L_0 + sum(k=1 to n) k = L_0 + n(n+1)/2 [∅]
Defined in Harmonic Complexity and the Recursive Spectrum Lexicon entry 9/10
Recursive Frequency Spacing
Non Uniform frequency intervals Δf_n = f_0 × (2n + 3) increasing linearly with recursion depth unlike constant classical spacing through computational complexity scaling.
Δf_n = H_(n+1) - H_n = f_0 × [(n + 2)² - (n + 1)²] = f_0 × (2n + 3) [𝕋⁻¹]
Defined in Harmonic Complexity and the Recursive Spectrum Lexicon entry 9/10
The full PulseCore lexicon — every term across the book, the simulation and the calculator.