An Auditable Transcript-to-Notebook Pipeline with Completion-Mass Capacity Bounds (Within-Model Results)
Abstract
This preprint formalizes an auditable, certificate-centric transcript-to-notebook compilation pipeline and derives within-model completion-mass capacity bounds. The safe bound follows from capacity/pigeonhole arguments; the strong bound is conditional on a finite local audit assumption (H-LCT / Lemma R′). No claims are made about P vs NP or unrestricted Turing machines.
Fields of Study & Subjects
Complexity and Algorithms in Graphs
semigroups and automata theory
DNA and Biological Computing
Publication details
- Journal / source
- Zenodo (CERN European Organization for Nuclear Research)
- Publication date
- 5 March 2026
- Language
- EN
- Document type
- Preprint