Decision Interfaces and Exact Recurrence Guards in Shared-Wake Lattice Walkers
This paper investigates how exact arithmetic decision boundaries and deterministic completion policies shape recurrent behavior in self-interacting lattice walkers. Walkers accumulate an integer-valued shared wake on a fixed incidence structure, encounter that history through locally oriented action interfaces, and select actions using cost-normalized wake readings. Equal primary scores satisfy a Diophantine condition, making completion policy an operative part of the dynamics rather than a numerical approximation or repair. Two-walker experiments demonstrate that changing action costs or the resolution of exact positive-score ties can select different recurrent routes. Some resulting routes continue to encounter exact ties throughout long recurrent stretches, establishing that completion policy can remain consequential after recurrence formation. A separate study of 1,296 reference-prepared two-walker states with third-walker injection compares eight deterministic realization policies, including variations in local completion, same-target arbitration, candidate wake readings, and walker-attached reorientation ledgers. Registered recurrence remains widespread, although realized histories, episode counts, and certificate outcomes differ. An overlap-aware census identifies 129 additional qualifying recurrent stretches without introducing new indefinite certificates. For an entered registered recurrent word, repeated integer wake deposition produces affine decision margins in packet count. Complete families of exact arithmetic guards then certify forward continuation or the first incompatible comparison under the stated autonomous-state assumptions, without simulating every intervening packet. The results establish a connection between exact arithmetic decision structure, dynamically consequential policy, and the finite certification of recurrent conduct in a deterministic shared-memory system.
Authors
- John Robert James (ORCID: https://orcid.org/0009-0007-7612-8595)
Publication Details
- Journal
- Zenodo (CERN European Organization for Nuclear Research)
- Published
- 2026-11-14
- DOI
- https://doi.org/10.5281/zenodo.24225425
- Primary Topic
- Cellular Automata and Applications
- Type
- preprint