Template:Did you know nominations/Reversible cellular automaton
< Template:Did you know nominations
Jump to navigation
Jump to search
Revision as of 20:24, 1 October 2015 by imported>David Eppstein (New DYK nom)
| DYK toolbox |
|---|
Reversible cellular automaton
- ... that for conventional computers, Landauer's principle gives a nonzero lower bound on energy per step, but the energy usage of reversible cellular automata can be arbitrarily close to zero?
- Reviewed: Leschi (fireboat)
Improved to Good Article status by David Eppstein (talk). Self-nominated at 20:23, 1 October 2015 (UTC).