1 citations · 1 across the 3 of their papers we have counts for
4 papers
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…
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…
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…
Termination of Rewriting on Reversible Boolean Circuits as a Free 3-Category Problem
Adriano Barile, Stefano Berardi, Luca Roversi
Reversible Boolean Circuits are an interesting computational model under many aspects and in different fields, ranging from Reversible Computing to Quantum Computing. Our contribut…