Manuscript VIII-C@3 · VIII-C-v3.tex · section · 3b070436
Finite dictionaries and canonical reports
Finite reversible implementation › Finite dictionaries and canonical reports · lines 1876–1881
Hamming-path intermediate words need not encode admissible geometries. The lemma is an existence and synthesis bound, not an efficiency or physical-time bound.