Time, Space, and Energy in Reversible Computing
Paul Vitanyi (CWI, University of Amsterdam, and National ICT, Australia)
TL;DR
This paper surveys 25 years of research on reversible computing, focusing on how it impacts energy, time, and space efficiency in general-purpose Turing machine models and simulations.
Contribution
It provides a comprehensive overview of the evolution and key results in reversible computation over the past quarter century.
Findings
Reversible computing can significantly reduce energy consumption.
Trade-offs exist between time, space, and energy in reversible simulations.
Reversible models can simulate irreversible computations with specific resource bounds.
Abstract
We survey results of a quarter century of work on computation by reversible general-purpose computers (in this setting Turing machines), and general reversible simulation of irreversible computations, with respect to energy-, time- and space requirements.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsQuantum Computing Algorithms and Architecture · Parallel Computing and Optimization Techniques · Computability, Logic, AI Algorithms