Recoverability of Multi-Step Memory-Model Dynamics in a Truth-Known Branch-Resolved Simulator

Zenodo (CERN European Organization for Nuclear Research) 2026 Preprint Open access

Read full text
Authors: Robin Langell
DOI: 10.5281/zenodo.22014177
Cited by: 2
References: 2

Abstract

This computational report evaluates measurement recoverability in a truth-known, branch-resolved memory simulator. The audited object is a six-step protocol-defined closure epoch: encoding establishes the incoming state before the epoch, while replay/consolidation transitions and slow structural updating occur within it. We test whether synthetic non-oracle charts recover a derived closure-signature summary of the composed epoch operator, and separately audit same-shape matrix association where dimensions permit comparison.

Fields of Study & Subjects

Simulation Techniques and Applications Parallel Computing and Optimization Techniques Formal Methods in Verification

Publication details

Journal / source
Zenodo (CERN European Organization for Nuclear Research)
Publication date
19 August 2026
Language
EN
Document type
Preprint