Re:Building a Completely Reversible Computer
by Zaak on Wednesday April 19, 2017 @07:42PM
(#14152771)
Reversible computers are turing-complete. The only requirement is you either have to store all intermediate results (no erasing), or you have to periodically "uncompute" them. I don't remember what the minimum bound on the overhead is, but it's manageable.
[ Parent
| on HN ]
There are no comments on this comment yet.