Reversify any sequential algorithm
Quantum Physics
2021-06-29 v2 Data Structures and Algorithms
Logic in Computer Science
Logic
Abstract
To reversify an arbitrary sequential algorithm , we gently instrument with bookkeeping machinery. The result is a step-for-step reversible algorithm that mimics step-for-step and stops exactly when does. Without loss of generality, we presume that algorithm is presented as an abstract state machine that is behaviorally identical to . The existence of such representation has been proven theoretically, and the practicality of such representation has been amply demonstrated.
Keywords
Cite
@article{arxiv.2105.05626,
title = {Reversify any sequential algorithm},
author = {Yuri Gurevich},
journal= {arXiv preprint arXiv:2105.05626},
year = {2021}
}