Manuscript Hawk04-C@1 · Hawk04-C-v1.tex · section · 94d46352
General finite adaptive programs
Row 4: the shrinking and mass-loss analogy › General finite adaptive programs · lines 950–964
This is a semantic theorem.
Admitting a specified unitary as a mathematical constant does not
synthesize it over a fixed gate library.
The distinction between channel correctness and actual storage is also
present in the sequential certificates of En02-C
CheungEn02C (Theorem thm:C1).
If “fresh content” is injected during a schedule, it must either be part of the code declared at the beginning or be a separately specified input. One may not silently change the logical input while comparing recovery of one fixed code.