Reversible computing and implicit computational complexity

Kristiansen, Lars

doi:10.1016/j.scico.2021.102723

Cited by 2 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Following Lars Kristiansen [1], we tried to give priority to readability, particularly in this Preamble, to reach a broader audience: reversibility is not a topic on its own, it is a tool that can bring enlightenment to diverse fields, and we hope that this preamble will help the reader unfamiliar with reversibility but curious about concurrency to understand how this tool can be leveraged with benefits.…”

Section: Preamblementioning

confidence: 99%

The correctness of concurrencies in (reversible) concurrent calculi

Aubert

2024

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

Section: Preamblementioning

confidence: 99%

The correctness of concurrencies in (reversible) concurrent calculi

Aubert

2024

Journal of Logical and Algebraic Methods in Programming

View full text Add to dashboard Cite

“…There are multiple approaches to ICC, see, e.g., the survey (Hofmann, 2000) for early developments pre-2000, andDal Lago (2022) for a recent survey about methods involving higher-order programs. Recently, implicit characterizations have been furnished for complexity classes using different modes of computation, or using different modes of computation as a means of characterizing standard complexity classes; in particular, this includes probabilistic computation (Lago & Toldin, 2015;Lago et al, 2021), reversible computation (Kristiansen, 2022), parallel computation (Baillot & Ghyselen, 2022), and higher-order complexity (Hainry et al, 2022).…”

Section: Related Workmentioning

confidence: 99%

Read/write factorizable programs

Bhaskar¹,

Simonsen²

2023

J. Funct. Prog.

View full text Add to dashboard Cite

In the cons-free programming paradigm, we eschew constructors and program using only destructors. Cons-free programs in a simple first-order language with string data capture exactly P, the class of polynomial-time relations. By varying the underlying language and considering other data types, we can capture several other complexity classes. However, no cons-free programming language captures any functional complexity class for fundamental reasons. In this paper, we cleanly extend the cons-free paradigm to encompass functional complexity classes. Namely, we introduce programs with data that can either only be destructed or only be constructed, which we enforce by a type system on the program variables. We call the resulting programs read/write- (or RW-)factorizable, show that RW-factorizable string programs capture exactly the class FP of polynomial-time functions, and that tail-recursive RW-factorizable programs capture exactly the class FL of logarithmic-space functions. Finally, we state and solve the nontrivial problem of syntactic composition of two RW-factorizable programs.

show abstract

Reversible computing and implicit computational complexity

Cited by 2 publications

References 19 publications

The correctness of concurrencies in (reversible) concurrent calculi

The correctness of concurrencies in (reversible) concurrent calculi

Read/write factorizable programs

Contact Info

Product

Resources

About