FPRD LabShare an approach

← Claims

theorem

PUB-persistent-scaffold-causal-algebra--thm-batch

Claim PUB-persistent-scaffold-causal-algebra--thm-batch

Exact statement

Theorem 9.2 (Simultaneous-batch compiler; fixed virtual initialization). Every bounded simultaneous record transducer with parameters (s,A,q,r)(s,A,q,r) , one fixed finite immutable pointer-closed initial graph, and plans determined by finite control, the input letter and bounded labelled rooted unfoldings has an exact letter-synchronous native scaffolding-automaton implementation of degree d=max⁡{1,s+Aq}d=\max\{1,s+Aq\} and observation/update distance at most r+1r+1 . Physical pointer identity is not an observable test; fixed initial records are virtual finite decoder data.

Statusreview publication statement; not independently promoted by this index
External reviewNo documented external or specialist review of this FPRD result is recorded.

Context

This row inventories an exact theorem-like statement extracted from a publication. Publication presence and mathematical maturity are intentionally separate.

Proof or evidence

The proof context is available at the linked publication anchor. This matrix run verified the statement-to-anchor link, not the proof itself.

Persistent scaffold computation: causal presentations, sewing, and feedback, Theorem 9.2 →

Verification notes

Reviewed on 2026-08-25 for stable extraction, publication anchor, and KaTeX validation. No theorem-level hostile proof audit is asserted.

Limitations

  • This row may overlap a governed FPRD claim; no equivalence is assumed until mapped.
  • The publication's review-stage label is not external specialist review evidence.

Open work

Map this publication statement to any governed claim, verify its hypotheses and proof dependencies, and remove duplicate inventory rows only after an exact mapping exists.