Pulse Core Lexicon
Recursive Depth Function
Definition
Recursive Depth Function is the relation S̃(n) = 2ⁿ × A₀, by which complexity doubles at each recursion level.
A₀ is the base complexity and n the recursion level. The sources give no dimensions.
It connects to Recursive Depth, Recursive Depth Hierarchy, Recursive Complexity Growth and Exponential Growth Dynamics.
Mathematical Expression
S̃(n) = 2ⁿ × A₀
Technical Details
Category Concept
Chapter Chapter 2
Importance
In the book Not used by this name yet