Bounded-Memory Reversible Computation and Housekeeping Dissipation: Garbage Entropy Rate, Active Forgetting, and Finite Reuse

Official website: distinctiontheory.orgPublic portal for the start guide, papers, claim status, failure registry, prior-art boundary, and citation resources. Canonical GitHub repository:https://github.com/yiningwu-research/Distinction-Theory FDS-P2 develops the second paper in the Physical Bridge Ladder of Active Finite Distinction Systems. Building on FDS-P1, it studies bounded-memory reversible computation as a finite-record accounting problem. Reversible computation can avoid immediate Landauer-style erasure by retaining enough side information to make an enlarged update invertible. Under bounded memory, however, this strategy accumulates garbage records that must be carried, refreshed, synchronized,…