Pulse Core Lexicon

Recursive Capacity Growth

Definition

Recursive Capacity Growth (f(r)) says that the data's reach grows two cells across every Pulse Rhythm, one Pulse Diameter on each side, so its capacity grows as an area: one Tempo fills 4 × 4 = 16 cells, the Zinf. After r Rhythms the data has reached r Pulse Diameters each way, 2r across, and fills (2r)² cells: an area, because the Pulsecore's data is written on the Bifold, a surface. When f(r) meets the Bifold's capacity χ_∂ = 16·4^L the Null Nova comes (the Bifold Containment Law, below); when the data alone fills it, at r = 2^(L+1), the Data Nova. Formally, f(r) = (2r)², where f(r) [∅] is structural capacity after r Rhythms: the area the data's reach covers, in cells, r [∅] is the data's count in Pulse Rhythms since the Pulsecore was sealed; its reach is 2r cells across, 2 [∅] is the cells the reach gains each Rhythm, one Pulse Diameter on each side. It connects to Bifold Containment Law, Data Nova, Pulsecore, Null Nova and Bifold.

Mathematical Expression

From the book · Chapter 3 · Data Novas and Dimensional Evolution

f(r) = (2r)² [∅]

Dimensional analysis:
Where (from the book): 2 [∅], f(r) [∅], r [∅]
[∅]
([∅] × [∅])² = [∅]² = [∅]
[∅] = [∅] ✓ Valid PulseCore Verified ✓

The data's reach grows two cells across every Pulse Rhythm, one Pulse Diameter on each side, so its capacity grows as an area: one Tempo fills 4 × 4 = 16 cells, the Zinf.

Technical Details

Category Concept

Chapter Chapter 3

Importance

In the book #287 of 1,511 terms · used 5 times

Related Terms