Pulse Core Lexicon
Unbounded Recursive Amplification
Definition
Unbounded Recursive Amplification (R(n)) is recursion left unbounded: (n+1)² grows without limit and threatens to overwhelm.
Left to itself the recursion's reach grows without bound, as the square of the count: a reach that widens by a fixed step every pulse covers an area that grows quadratically. The First Fold is what bounds it: at the containment threshold the growth folds into periodicity, the book's form of renormalisation, and the Novas of Part 3.6 are where the folds fall.
Formally, R(n) = (n+1)² → ∞ as n → ∞, where R(n) [∅] is recursive amplification, n [∅] is recursion level, (n+1)² [∅] is quadratic amplification term, → [∅] is approaches operator, ∞ [∅] is infinity symbol, 1 [∅] is unit increment.
It connects to Quadratic Amplification, Recursive Amplification, Containment Threshold and First Fold.
Mathematical Expression
From the book · Chapter 3 · Pulse Radius, The First Fold, and Recursive Constraints
R(n) = (n+1)² → ∞ as n → ∞ [∅]
Threatens overwhelming recursion.
➢ Left to itself the recursion's reach grows without bound, as the square of the count: a reach that widens by a fixed step every pulse covers an area that grows quadratically. The First Fold is what bounds it: at the containment threshold the growth folds into periodicity, the book's form of renormalisation, and the Novas of Part 3.6 are where the folds fall.
Where:
- R(n) [∅] – recursive amplification
- n [∅] – recursion level
- (n+1)² [∅] – quadratic amplification term
- → [∅] – approaches operator
- ∞ [∅] – infinity symbol
- 1 [∅] – unit increment
Technical Details
Category Concept
Chapter Chapter 3
Importance
In the book #614 of 1,511 terms · used 2 times