Manuscript VIII-B@3 · VIII-B-v3.tex · section · 3aa6baa1

A finite algebraic table and reversible realization

A finite algebraic table and reversible realization · lines 1769–1783

The finite construction has four layers:

semantic constructor ⟵ algebraic packet table ⟵ canonical classical map ⟵ reversible circuit .

Decoder equality is asserted only on canonical promised forward inputs, not on arbitrary intermediate circuit words.

Displayed formulas in this passage

unlabeled · line 1772
$semantic constructor ⟵ algebraic packet table ⟵ canonical classical map ⟵ reversible circuit .$