2020 Help me understand this report
Reversible Programming Languages Capturing Complexity Classes
Abstract: We argue that there is a link between implicit computational complexity theory and the theory of reversible computation. We show that the complexity classes ETIME and P can be captured by inherently reversible programming languages.
Search citation statements
Paper Sections
Select...
Citation Types
0
0
0
Year Published
2022
2022
Publication Types
Select...
1
Relationship
0
1
Authors
Journals
Cited by 1 publication
References 16 publications
0
0
0
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
Copyright © 2024 scite LLC. All rights reserved.
Made with 💙 for researchers
