ThatAIguyA world of ideas

THE CONSCIOUSNESS ATLAS
Read. Experiment. Follow the evidence.

ConsciousnessLearn · Explore · Joseph Anady

Stable affine recurrence toward one

Subtracting one from both sides gives error_next=a×error. For 0<a<1, the positive error shrinks geometrically but remains nonzero at every finite step when initialized above one. This supplies an ordinary nonconscious dynamical example of persistent finite-time…

Declaration and state changedocumented formula
Learn with the Atlas

Read the state update

Follow the relationship between a current value and the next one.

Open guided lesson
eq-737570dabb1a6emathematical expression
zn+1=azn+(1−a){z}_{n+1}=a{z}_{n}+\left(1-a\right)

Read the equation

Subtracting one from both sides gives error_next=a×error. For 0<a<1, the positive error shrinks geometrically but remains nonzero at every finite step when initialized above one. This supplies an ordinary nonconscious dynamical example of persistent finite-time discrepancy with eventual convergence.

Terms & definitions

TermMeaning in this source
a

Contraction factor between zero and one

y_n

Scalar state; z in another version

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
Appendix C. Why the bare divergence condition needs specificity

Consider the scalar recurrence zn+1=azn+1−a with z0=2 and 0<a<1. Its solution is zn=1+an. It changes internally, differs from its original value at every subsequent finite step, and never returns to 2. A program could repeatedly report its current value without changing this algebra. Thus permanent difference from an initialization is mathematically broad, not peculiar to the present model.

This example does not prove the recurrence lacks experience. It establishes what the proposed criterion accepts. A theory identifying all such systems with primitive cognition may adopt that consequence, but should derive additional observable constraints rather than presenting the same inequality as independent evidence for its interpretation.

Similarly, merely placing a loop near a node is not a specified causal mechanism. If an accumulation law is An+1=λAn+q with 0≤λ<1, q>0, and A0=0, then An=q1−λn/1−λ. A threshold strictly above q/1−λ is never crossed despite infinitely many updates. With no leakage and fixed positive increments, a finite threshold is crossed. These are different models. A general “enough speed or enough circulation” law requires assumptions about coupling, cancellation, and dissipation.
[Context excerpt; full source linked.]
Exact original notation
{z}_{n+1}=a{z}_{n}+\left(1-a\right)

Related builds

Sources & provenance

01
Declaration_and_State_Change_Final.docx
paragraph 333, math 1 · Sep 17, 2026
{z}_{n+1}=a{z}_{n}+\left(1-a\right)
02
Declaration_and_State_Change_Final.docx
paragraph 333, math 1 · Sep 17, 2026
{z}_{n+1}=a{z}_{n}+\left(1-a\right)

Search equations, builds, manuscript text, and recovered sources.