Pulse Core Lexicon
Pulse Recursive Depth Scaling
Definition
Pulse Recursive Depth Scaling (ℜ⫷(n)) is the accumulated computational complexity through stacking up to recursion level n, the sum over levels i = 1 to n of i times 2^(i−1).
Each recursion level contributes a weighted exponential increment, so complexity grows inevitably from iterating simple binary rules rather than being added from outside. The book illustrates it with the Complexity Cascade: Level 0 is the Prime Pulse, 0 → 1 → 0, with complexity 1; Level 1 the First Recursion, ℜ₁ = ☫⧱(①₀, ①₁), with complexity 2; Level 2 pattern stabilization, ℜ₂ = ☫⧱(ℜ₁, ①₂), with complexity 8; and Level n, ℜₙ = ☫⧱(ℜₙ₋₁, ①ₙ, ↁ𝓜(n)), with complexity n · 2ⁿ. Each level incorporates previous recursions and historical states.
Formally, ℜ⫷(n) = Σᵢ₌₁ⁿ i · 2^(i−1), where ℜ⫷(n) is the recursive depth scaling at level n, the summation runs over recursive levels i = 1 to n, i is the level index, 2^(i−1) is the base-2 exponential scaling factor, and n is the maximum recursion level. All are dimensionless: [∅] = Σ [∅] × [∅] = [∅].
It connects to Recursive Stacking, Recursive Depth, Pulse Complexity Measure, First Recursion and Recursive Coupling Equation.
Mathematical Expression
From the book · Chapter 1 · The First Recursive Loop
ℜ⫷(n) = Σᵢ₌₁ⁿ i · 2^{i-1}
Where:
- ℜ⫷(n) [∅] – recursive depth scaling at level n; accumulated computational complexity through stacking
- Σᵢ₌₁ⁿ [∅] – summation operator from i=1 to n across recursive levels
- i [∅] – summation index variable representing discrete recursive level
- 2^{i-1} [∅] – exponential scaling factor with base 2 for binary computational amplification
- n [∅] – maximum recursion level parameter measuring total depth
Technical Details
Category Equation
Chapter Chapter 1
Importance
In the book #925 of 1,511 terms · used 1 time