Reversible Programming Languages Capturing Complexity Classes

We argue that there is a link between implicit computational complexity theory and the theory of reversible computation. We show that the complexity classes [Formula: see text] and [Formula: see text] can be captured by inherently reversible programming languages.

Detalles Bibliográficos
Autor principal: Kristiansen, Lars
Formato: Online Artículo Texto
Lenguaje:English
Publicado: 2020
Materias:
Article
Acceso en línea:https://www.ncbi.nlm.nih.gov/pmc/articles/PMC7345302/
http://dx.doi.org/10.1007/978-3-030-52482-1_6
Descripción
Sumario:We argue that there is a link between implicit computational complexity theory and the theory of reversible computation. We show that the complexity classes [Formula: see text] and [Formula: see text] can be captured by inherently reversible programming languages.

Ejemplares similares