Hide metadata

Reversible Computing and Implicit Computational Complexity

dc.date.accessioned2021-11-01T16:32:16Z
dc.date.available2021-11-01T16:32:16Z
dc.date.created2021-09-12T21:40:35Z
dc.date.issued2022
dc.identifier.citationKristiansen, Lars . Reversible Computing and Implicit Computational Complexity. Science of Computer Programming. 2021
dc.identifier.urihttp://hdl.handle.net/10852/89090
dc.description.abstractWe 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.
dc.languageEN
dc.rightsAttribution 4.0 International
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/
dc.titleReversible Computing and Implicit Computational Complexity
dc.typeJournal article
dc.creator.authorKristiansen, Lars
cristin.unitcode185,15,5,25
cristin.unitnamePROG Programmering
cristin.ispublishedfalse
cristin.fulltextpostprint
cristin.qualitycode2
dc.identifier.cristin1933553
dc.identifier.bibliographiccitationinfo:ofi/fmt:kev:mtx:ctx&ctx_ver=Z39.88-2004&rft_val_fmt=info:ofi/fmt:kev:mtx:journal&rft.jtitle=Science of Computer Programming&rft.volume=&rft.spage=&rft.date=2021
dc.identifier.jtitleScience of Computer Programming
dc.identifier.volume213
dc.identifier.doihttps://doi.org/10.1016/j.scico.2021.102723
dc.identifier.urnURN:NBN:no-91705
dc.type.documentTidsskriftartikkel
dc.type.peerreviewedPeer reviewed
dc.source.issn0167-6423
dc.identifier.fulltextFulltext https://www.duo.uio.no/bitstream/handle/10852/89090/4/1-s2.0-S0167642321001167-main.pdf
dc.type.versionPublishedVersion
cristin.articleid102723


Files in this item

Name:
1-s2.0-S0167642321001167-main.pdf
Size:
480.0Kb
Format:
application/
View/Open

Appears in the following Collection

Hide metadata

Attribution 4.0 International
This item's license is: Attribution 4.0 International