Bennett's trick makes any computation reversible by uncomputing instead of erasing

Popularity Index: 2 Updated at 2026-10-17 09:36 UTC

Sites

Related Topics

Reversible logic does not mean zero heat: interconnect and clocking still burn watts Landauer's principle puts a floor on erasure at kT ln 2 per bit Garbage collection is computational irreversibility made explicit Why a reversible program needs a history of its own steps to run backwards CMOS already runs close enough to Landauer that further voltage scaling stalls Adiabatic circuits recover charge instead of dumping it and only win at low frequency Nobody has built a general-purpose reversible CPU and the memory bill is why Fredkin's conservative logic keeps the number of ones constant through every gate The second law does not forbid reversible computing it just moves the entropy somewhere A Toffoli gate can compute anything but it has to keep its garbage bits

Hot Categories

Featured Categories