Manuscript XXII-B@1 · XXII-B.tex · section · 9d5c569c

Candidate B: combs and process tensors on declared slots

Operational languages and candidate data › Candidate B: combs and process tensors on declared slots · lines 381–419

XXII-B@1#eq:comb-normalization

Back to manuscript

A deterministic comb is a positive Choi operator on declared, ordered input/output slots, satisfying recursive trace conditions of the form

with tensor-factor order fixed by the chosen convention CDP (Theorem 5). A standard multi-time process tensor similarly describes interventions at a declared sequence of time steps, with its specified boundary systems and containment conditions Pollock.

Accordingly, the expression “a standard process tensor with non-preinstalled slot order” is not adopted here. Candidate B may extract which permitted interventions influence which later outputs, or a finer operational relation within the declared temporal interface. It cannot report the declared slot ordering as a conclusion derived from its outcome probabilities.

An unordered or coherently controlled-order higher-order object requires a different explicitly defined interface. It must not be obtained by dropping the comb normalization conditions while keeping the same name.

Memory, temporal correlations, or process-tensor tomography do not supply a unique continuous-time interpolation from one coarse datum. XIX-C's counterexample in Section sec:test-refinement illustrates the missing refinement information CheungXIXC (prop:two-limits). It is a warning about that inference, not an assertion that every fully specified process tensor has ambiguous refinement.

Displayed formulas in this passage

  • XXII-B@1#eq:comb-normalization · line 386