Reversible computing and implicit computational complexity

•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 p.•Furthermore, we discuss and analyze higher-order versions of our reversible programmi...

Full description

Saved in:

Bibliographic Details
Published in:	Science of computer programming Vol. 213; p. 102723
Main Author:	Kristiansen, Lars
Format:	Journal Article
Language:	English
Published:	Elsevier B.V 01.01.2022
Subjects:	Complexity classes Implicit computational complexity Invertible programming languages Reversible computing Turing machines Reversible computing Invertible programming languages Turing machines Implicit computational complexity Complexity classes
ISSN:	0167-6423, 1872-7964
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!

Description
Summary:	•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 p.•Furthermore, we discuss and analyze higher-order versions of our reversible programming languages. 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 ▪. Furthermore, we discuss and analyze higher-order versions of our reversible programming languages.
ISSN:	0167-6423 1872-7964
DOI:	10.1016/j.scico.2021.102723