Towards a Characterization of Two-way Bijections in a Reversible Computational Model
arXiv:2506.03382
Abstract
We introduce an imperative, stack-based, and reversible computational model that characterizes Two-way Bijections both implicitly, concerning their computational complexity, and with zero-garbage.
arXiv comment8 pages, 3 figures, 5 listings. Author's copy of the version which will appear in the Proceedings of the 17th International Conference, RC 2025, Odense, Denmark, July 3-4, 2025