Reversibility in space-bounded computation

被引：3
|
作者：
Morita, Kenichi [1 ]
机构：
[1] Hiroshima Univ, Dept Informat Engn, Higashihiroshima 724, Japan
来源：
INTERNATIONAL JOURNAL OF GENERAL SYSTEMS | 2014年 / 43卷 / 07期
关键词：
reversible computing; reversibility; determinism; space complexity; space-bounded Turing machine; symmetric Turing machine;
D O I：
10.1080/03081079.2014.920998
中图分类号：
TP301 [理论、方法];
学科分类号：
081202 ;
摘要：
In this paper, we investigate how computing power of a space-bounded Turing machine (TM) is affected by reversibility and determinism. We show an irreversible deterministic TM (IDTM), and a reversible non-deterministic TM (RNTM) can be simulated by a reversible and deterministic TM (RDTM) that uses exactly the same numbers of storage tape symbols and storage tape squares. Thus, an RDTM has relatively high capability in spite of the constraints of reversibility and determinism. Here, we also discuss a space-bounded symmetric TM.
引用
收藏
页码：697 / 712
页数：16
相关论文
共 50 条
  • [31] Matchgate and space-bounded quantum computations are equivalent
    Jozsa, Richard
    Kraus, Barbara
    Miyake, Akimasa
    Watrous, John
    [J]. PROCEEDINGS OF THE ROYAL SOCIETY A-MATHEMATICAL PHYSICAL AND ENGINEERING SCIENCES, 2010, 466 (2115): : 809 - 830
  • [32] LANGUAGES ACCEPTED BY SPACE-BOUNDED ORACLE MACHINES
    BOOK, RV
    [J]. ACTA INFORMATICA, 1979, 12 (02) : 177 - 185
  • [33] Non-Malleable Codes for Space-Bounded Tampering
    Faust, Sebastian
    Hostakova, Kristina
    Mukherjee, Pratyay
    Venturi, Daniele
    [J]. ADVANCES IN CRYPTOLOGY - CRYPTO 2017, PART II, 2017, 10402 : 95 - 126
  • [34] Trial and error: A new approach to space-bounded learning
    Ameur, Foued
    Fischer, Paul
    Höffgen, Klaus -U.
    auf der Heide, Friedhelm Meyer
    [J]. Acta Informatica, 1996, 33 (05) : 621 - 630
  • [35] SPACE-BOUNDED REDUCIBILITY AMONG COMBINATORIAL PROBLEMS
    JONES, ND
    [J]. JOURNAL OF COMPUTER AND SYSTEM SCIENCES, 1975, 11 (01) : 68 - 85
  • [36] Deterministic amplification of space-bounded probabilistic algorithms
    Bar-Yossef, Z
    Goldreich, O
    Wigderson, A
    [J]. FOURTEENTH ANNUAL IEEE CONFERENCE ON COMPUTATIONAL COMPLEXITY, PROCEEDINGS, 1999, : 188 - 198
  • [37] On the complexity of simulating space-bounded quantum computations
    John Watrous
    [J]. computational complexity, 2003, 12 : 48 - 84
  • [38] ON SEVERAL KINDS OF SPACE-BOUNDED ONLINE MULTICOUNTER AUTOMATA
    VOELKEL, L
    [J]. LECTURE NOTES IN COMPUTER SCIENCE, 1985, 199 : 465 - 473
  • [39] Time-bounded and space-bounded sensing in wireless sensor networks
    Saukh, Olga
    Sauter, Robert
    Marron, Pedro Jose
    [J]. DISTRIBUTED COMPUTING IN SENSOR SYSTEMS, 2008, 5067 : 357 - 371
  • [40] SPACE-BOUNDED SIMULATION OF MULTITAPE TURING-MACHINES
    ADLEMAN, LM
    LOUI, MC
    [J]. MATHEMATICAL SYSTEMS THEORY, 1981, 14 (03): : 215 - 222
12345