VIII.06 / Zuse, Fredkin, and cellular-automaton approaches
Run a reversible operation backward.
Use a controlled swap on three binary inputs. Record the input and output for every possible input combination and verify that each output identifies one input. Compare this with an operation that erases a bit, where multiple inputs collapse to the same output. The table makes logical reversibility visible without assuming a particular physical implementation.
