3 papers
cs.LO2025
Towards a Characterization of Two-way Bijections in a Reversible Computational Model
Matteo Palazzo, Luca Roversi
We introduce an imperative, stack-based, and reversible computational model that characterizes Two-way Bijections both implicitly, concerning their computational complexity, and wi…
cs.PL2025
Reversible Computation with Stacks and "Reversible Management of Failures"
Matteo Palazzo, Luca Roversi
This work examines approaches to making computational models reversible. Broadly speaking, transforming a computational model into a reversible one, i.e. reversibilizing it, means…
cs.PL2024
Algorithmically Expressive, Always-Terminating Model for Reversible Computation
Matteo Palazzo, Luca Roversi
Concerning classical computational models able to express all the Primitive Recursive Functions (PRF), there are interesting results regarding limits on their algorithmic expressiv…