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...

Celý popis

Uloženo v:

Podrobná bibliografie
Vydáno v:	Science of computer programming Ročník 213; s. 102723
Hlavní autor:	Kristiansen, Lars
Médium:	Journal Article
Jazyk:	angličtina
Vydáno:	Elsevier B.V 01.01.2022
Témata:	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
On-line přístup:	Získat plný text
Tagy:	Přidat tag Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!

Popis
Shrnutí:	•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