Manuscript Psy03-B@1 · Psy03-B-v1.tex · section · 8ca3caf9

Exact deletion versus the source's tied threshold

Irreversible structural memory and finite counts › Exact deletion versus the source's tied threshold · lines 769–777

Back to manuscript

Apply the theorem separately when allocation is layerwise. The per-update rounding allowance is then bounded by the number of eligible layers, not necessarily one. This is a finite-count refinement of the hard-control discontinuity recorded in Psy01-A CheungPsy01A.

Nearby in this section