# A Reversible NAND Gate

The great discovery of Bennett and, independently, of Fredkin is that it is possible to do computation with a different kind of fundamental gate unit, namely, a reversible gate unit. I have illustrated their idea--with a unit which I could call a reversible NAND gate. It has thre inputs and thre outputs. Of the outputs, tow, A' and B', are the same as two of the inputs, A and B, but the third input works this way. C' is the same as C unless A and B are both 1, in which case it changes whatever C is. For instance, if C is 1 it is changed to 0, if C is 0 it is changed to 1--but these changes only happen if both A and B are 1. If you put two of these gates in succession, you see that A and B will go through, and if C is not changed in both it stays the same. If C is changed, it is changed twice so that it stays the same. So this gate can reverse itself and no information has been lost. It is possible to discover what wnet in if you know what came out.

## Notes:

Feynman describes a reversible logic gate, with three inputs and three outputs, one of which tracks the change in input and output, allowing the computer to reverse its operation and potentially pursue a different route.

Folksonomies: computing

Taxonomies:
/sports/running and jogging (0.543741)
/law, govt and politics/legal issues/legislation/tax laws (0.450740)
/technology and computing (0.370027)

Keywords:
reversible NAND gate (0.905689 (neutral:0.000000)), reversible gate unit (0.892034 (neutral:0.000000)), fundamental gate unit (0.798500 (positive:0.269889)), reversible logic gate (0.793955 (neutral:0.000000)), thre outputs (0.640501 (neutral:0.000000)), great discovery (0.472841 (positive:0.538039)), inputs (0.469448 (neutral:0.000000)), different kind (0.463378 (positive:0.269889)), input works (0.462179 (positive:0.306239)), out. Feynman describes a reversible logic gate, with three inputs and three outputs, one of which tracks the change in input and output, allowing the computer to reverse its operation and poten (0.414336 (neutral:0.000000)), different route. (0.410394 (neutral:0.000000)), wnet (0.282706 (neutral:0.000000)), instance (0.266495 (negative:-0.220221)), Feynman (0.261255 (neutral:0.000000)), Bennett (0.259182 (positive:0.538039)), succession (0.258303 (negative:-0.245069)), computation (0.257176 (positive:0.269889)), idea (0.252768 (negative:-0.404597)), gates (0.251028 (negative:-0.245069)), Fredkin (0.249302 (positive:0.269889)), case (0.246438 (neutral:0.000000)), way (0.243975 (positive:0.306239)), information (0.241837 (negative:-0.749034)), change (0.240566 (neutral:0.000000))

Entities:
logic gate:FieldTerminology (0.992513 (neutral:0.000000)), Bennett:Person (0.532420 (positive:0.538039)), Fredkin:City (0.499764 (positive:0.269889)), Feynman:Person (0.398929 (neutral:0.000000))

Concepts:
Input/output (0.955090): dbpedia | freebase Computing Machines of the Future
Books, Brochures, and Chapters>Book Chapter:  Feynman, Richard (1985), Computing Machines of the Future, Nishina Memorial Foundation, Nishina Memorial Lecture, Retrieved on 2010-11-07