Towards a Characterization of Two-way Bijections in a Reversible Computational Model

TL;DR

This paper introduces a reversible, stack-based computational model that characterizes two-way bijections both in terms of computational complexity and with zero-garbage, advancing understanding of reversible computation.

Contribution

It presents a novel imperative, stack-based reversible model that explicitly characterizes two-way bijections with zero-garbage and complexity considerations.

Findings

Characterizes two-way bijections in a reversible model

Achieves zero-garbage computation in the model

Provides complexity insights for reversible computations

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.