Towards a Characterization of Two-way Bijections in a Reversible Computational Model
Fuente:
arXiv
Gespeichert in:
| Hauptverfasser: | , |
|---|---|
| Format: | Preprint |
| Veröffentlicht: |
2025
|
| Schlagworte: | |
| Online-Zugang: | |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| _version_ | 1866908392459599872 |
|---|---|
| author | Palazzo, Matteo Roversi, Luca |
| author_facet | Palazzo, Matteo Roversi, Luca |
| contents | 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. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2506_03382 |
| institution | arXiv |
| publishDate | 2025 |
| record_format | arxiv |
| spellingShingle | Towards a Characterization of Two-way Bijections in a Reversible Computational Model Palazzo, Matteo Roversi, Luca Logic in Computer Science Computational Complexity Programming Languages F.3.2 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. |
| title | Towards a Characterization of Two-way Bijections in a Reversible Computational Model |
| topic | Logic in Computer Science Computational Complexity Programming Languages F.3.2 |
| url | https://arxiv.org/abs/2506.03382 |