Harmonic Complexity Scaling

Harmonic Complexity Scaling is the quadratic growth of harmonic frequencies with harmonic index that BPT puts in place of the classical linear progression of overtones. It is driven by Computational Load Accumulation: each recursive step processes all previous states, so processing requirements grow quadratically with depth, and that growth appears in the frequency domain as harmonics scaling with (n+1)² rather than with even spacing. The book reads this as the computational substrate's influence on frequency, tying computational load to pulse density and to Temporal Drag, and attributes the quadratic form to recursive accumulation of structural complexity per pulse iteration through Information Conservation. The scaling is carried by the Pulse Density Function P(n) = (n + 1)², where P(n) is the pulse density and n the recursion depth index, both dimensionless [∅]; the book's check is valid and verified. The current definition writes the harmonic frequencies as H_n = ν_0 × (n + 1)², with ν_0 = 1/①⥂⧗⌂ the fundamental frequency and n the harmonic index. It connects to Computational Load Accumulation, Pulse Density, the Harmonic Origin Pulse, Harmonic Clustering Coefficient, Temporal Drag and Information Conservation.