Reversible computing and implicit computational complexity

被引：2
|
作者：
Kristiansen, Lars [1 ,2 ]
机构：
[1] Univ Oslo, Dept Informat, Oslo, Norway
[2] Univ Oslo, Dept Math, Oslo, Norway
来源：
SCIENCE OF COMPUTER PROGRAMMING | 2022年 / 213卷
关键词：
Reversible computing; Invertible programming languages; Implicit computational complexity; Complexity classes; Turing machines; LOGSPACE;
D O I：
10.1016/j.scico.2021.102723
中图分类号：
TP31 [计算机软件];
学科分类号：
081202 ; 0835 ;
摘要：
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. (c) 2021 The Author(s). Published by Elsevier B.V. This is an open access article under the CC BY license (http://creativecommons.org/licenses/by/4.0/).
引用
收藏
页数：19
相关论文
共 50 条
  • [1] Implicit computational complexity
    Marion, JY
    THEORETICAL COMPUTER SCIENCE, 2004, 318 (1-2) : 1 - 1
  • [2] Quantum implicit computational complexity
    Dal Lago, Ugo
    Masini, Andrea
    Zorzi, Margherita
    THEORETICAL COMPUTER SCIENCE, 2010, 411 (02) : 377 - 409
  • [3] Developments in implicit computational complexity
    Marion, Jean-Yves
    INFORMATION AND COMPUTATION, 2015, 241 : 1 - 2
  • [4] Automated implicit computational complexity analysis
    Avanzini, Martin
    Moser, Georg
    Schnabl, Andreas
    AUTOMATED REASONING, PROCEEDINGS, 2008, 5195 : 132 - +
  • [5] Special Issue on Implicit Computational Complexity
    Baillot, Patrick
    Marion, Jean-Yves
    Della Rocca, Simona Ronchi
    ACM TRANSACTIONS ON COMPUTATIONAL LOGIC, 2009, 10 (04)
  • [6] Program analysis for implicit computational complexity
    Jones, ND
    PROGRAMS AS DATA OBJECTS, PROCEEDINGS, 2001, 2053 : 1 - 1
  • [7] Granular Computing and Computational Complexity
    Zhang, Bo
    ROUGH SET AND KNOWLEDGE TECHNOLOGY (RSKT), 2010, 6401 : 7 - 7
  • [8] Optical computing and computational complexity
    Woods, Damien
    UNCONVENTIONAL COMPUTATION, PROCEEDINGS, 2006, 4135 : 27 - 40
  • [9] On the computational complexity of conservative computing
    Mauri, G
    Leporati, A
    MATHEMATICAL FOUNDATIONS OF COMPUTER SCIENCE 2003, PROCEEDINGS, 2003, 2747 : 92 - 112
  • [10] Computational Complexity of Reversible Reaction Systems
    Holzer, Markus
    Rauch, Christian
    REVERSIBLE COMPUTATION, RC 2023, 2023, 13960 : 40 - 54
12345