Reversible Computing and Implicit Computational Complexity

Kristiansen, Lars
Journal article; PublishedVersion; Peer reviewed
View/Open
Year
2022
Permanent link
http://urn.nb.no/URN:NBN:no-91705

CRIStin
1933553

Metadata
Show metadata
Appears in the following Collection
Original version
Science of Computer Programming. 2022, 213:102723, DOI: https://doi.org/10.1016/j.scico.2021.102723
Abstract
We argue that there is a link between implicit computational complexity theory and reversible computation. We introduce inherently reversible programming languages which capture the complexity classes etime and Image 1. Furthermore, we discuss and analyze higher-order versions of our reversible programming languages.
Attribution 4.0 International
This item's license is: Attribution 4.0 International