Reference library
Logical Reversibility of Computation
Paper summary
Constructs logically reversible simulations of general computations by retaining intermediate history, copying the output, and reversing unwanted work. This shows that useful computation need not require irreversible information loss at every step.
Relevance to the project
Clarifies entropy arguments and the distinction between checkpoints/history and erasure. Memory and time costs should accompany claims about reversible computation.
Logical reversibility alone does not make an implementation physically lossless.
Source record
- Reference ID
- article-https-www-cs-princeton-edu-courses-archive-fall04-cos576-paperscs191-bennett73-html
- Archived version
- Public published-paper scan; source is an independent technical reference archive
- Summary provenance
- reference-library/papers/article-https-www-cs-princeton-edu-courses-archive-fall04-cos576-paperscs191-bennett73-html/metadata.json · summary
- Review status
- initial orientation summary; not a critical full-paper review
- Reading scope
- Selected abstract/opening and available closing discussion/conclusion passages in the preserved text extract; broader project notes provide context. No reproduction of experiments, exhaustive methods review, or equation/figure audit.