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

June 03, 2025 · The Ethereal · 🏛 International Workshop on Reversible Computation

🔮 THE ETHEREAL: The Ethereal
Pure theory — exists on a plane beyond code

"No code URL or promise found in abstract"

Evidence collected by the PWNC Scanner

Authors Matteo Palazzo, Luca Roversi arXiv ID 2506.03382 Category cs.LO: Logic in CS Cross-listed cs.CC, cs.PL Citations 0 Venue International Workshop on Reversible Computation Last Checked 5 months ago
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.
Community shame:
Not yet rated
📄 View on arXiv 🌐 View on ar5iv 📑 PDF 🎉 Report Code Found
Community Contributions

Found the code? Know the venue? Think something is wrong? Let us know!

📜 Similar Papers

In the same crypt — Logic in CS