Read the equation
The retention factor 0.9 keeps ninety percent of the preceding state on each update. Earlier contributions consequently decay as powers of 0.9. It is the chosen setting of the example, distinct from an empirically fitted memory time constant.
Terms & definitions
| Term | Meaning in this source |
|---|---|
| rho | Retention factor |
How it works
Read the definition from its right-hand expression to the quantity on the left. Its surrounding source records the intended input, state, or parameter context. Where the source leaves an operation unspecified, this page preserves that gap.
Assumptions & limits
Source recovery establishes that the expression appears in this record. Its mathematical validity, implementation behavior, and interpretation must be assessed separately. See the linked source and research notes for the checks available for this version.
Original context
Read the surrounding source passage
solving the geometric series gives An=q1−ρn1−ρ. By contrast, for an imposed nonleaky rule An+1=An+0.1, threshold two is reached at step 20. That result follows from the nonleakage assumption. It does not establish that all physical or computational loops implement a nonleaky accumulator. Even positive increments need not produce unbounded accumulation: summable increments such as 2−n have a finite total. A valid crossing theorem needs a condition on the cumulative sum, not just an assertion that data keeps moving. 7.3 Speed can alter timing without creating a new capability
Exact original notation
\rho =0.9