• Search Research Projects
  • Search Researchers
  • How to Use
  1. Back to previous page

Reversible Computing as a Future Computing Mechanism and Its Theoretical Systematization

Research Project

Project/Area Number 24500017
Research Category

Grant-in-Aid for Scientific Research (C)

Allocation TypeMulti-year Fund
Section一般
Research Field Fundamental theory of informatics
Research InstitutionHiroshima University

Principal Investigator

MORITA Kenichi  広島大学, 工学(系)研究科(研究院), 名誉教授 (00093469)

Project Period (FY) 2012-04-01 – 2015-03-31
Project Status Completed (Fiscal Year 2014)
Budget Amount *help
¥2,340,000 (Direct Cost: ¥1,800,000、Indirect Cost: ¥540,000)
Fiscal Year 2014: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2013: ¥650,000 (Direct Cost: ¥500,000、Indirect Cost: ¥150,000)
Fiscal Year 2012: ¥1,040,000 (Direct Cost: ¥800,000、Indirect Cost: ¥240,000)
Keywords可逆計算機構 / 可逆論理素子 / 可逆論理回路 / 可逆チューリング機械 / 可逆順序機械 / 可逆セルオートマトン / 物理的可逆性
Outline of Final Research Achievements

Reversible computing is a paradigm of computation that has a close relation to physical reversibility. As in the case of quantum computing, it will also become important when we develop future computing systems that directly utilize microscopic physical phenomena for their logical operations. In this study, we investigated reversible physical models, reversible logic elements and circuits, and reversible computing systems, which form some hierarchical levels in reversible computing. We studied basic properties of these models, and systematized the obtained results in a theory of reversible computing. In particular, we clarified computational capabilities of 2-state reversible logic elements, reversible Turing machines, reversible cellular automata, and others, and showed that even very simple reversible systems exhibit computational universality.

Report

(4 results)
  • 2014 Annual Research Report   Final Research Report ( PDF )
  • 2013 Research-status Report
  • 2012 Research-status Report
  • Research Products

    (25 results)

All 2015 2014 2013 2012 Other

All Journal Article (10 results) (of which Acknowledgement Compliant: 4 results,  Peer Reviewed: 7 results) Presentation (6 results) (of which Invited: 2 results) Book (2 results) Remarks (7 results)

  • [Journal Article] General design of reversible sequential machines based on reversible logic elements2015

    • Author(s)
      M.-X. Tang, J. Lee, K. Morita
    • Journal Title

      Theoretical Computer Science

      Volume: 568 Pages: 19-27

    • DOI

      10.1016/j.tcs.2014.11.032

    • Related Report
      2014 Annual Research Report
    • Peer Reviewed
  • [Journal Article] Universal reversible Turing machines with a small number of tape symbols2015

    • Author(s)
      K. Morita
    • Journal Title

      Fundamenta Informaticae

      Volume: 138 Issue: 1-2 Pages: 17-29

    • DOI

      10.3233/fi-2015-1195

    • Related Report
      2014 Annual Research Report
    • Peer Reviewed / Acknowledgement Compliant
  • [Journal Article] Reversibility in space-bounded computation2014

    • Author(s)
      K. Morita
    • Journal Title

      Int. J. of General Systems

      Volume: 43 Issue: 7 Pages: 697-712

    • DOI

      10.1080/03081079.2014.920998

    • Related Report
      2014 Annual Research Report
    • Acknowledgement Compliant
  • [Journal Article] Compact realization of reversible Turing machines by 2-state reversible logic elements2014

    • Author(s)
      K. Morita, R. Suyama
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 8553 Pages: 280-292

    • DOI

      10.1007/978-3-319-08123-6_23

    • ISBN
      9783319081229, 9783319081236
    • Related Report
      2014 Annual Research Report
    • Peer Reviewed / Acknowledgement Compliant
  • [Journal Article] How can we construct reversible machines out of reversible logic element with memory?2014

    • Author(s)
      K. Morita, T. Ogiro
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 8808 Pages: 352-366

    • DOI

      10.1007/978-3-319-13350-8_26

    • ISBN
      9783319133492, 9783319133508
    • Related Report
      2014 Annual Research Report
    • Acknowledgement Compliant
  • [Journal Article] Universality problems on reversible logic elements with 1-bit memory2014

    • Author(s)
      Y. Mukai, T. Ogiro, K. Morita
    • Journal Title

      International Journal of Unconventional Computing

      Volume: 10

    • Related Report
      2013 Research-status Report
    • Peer Reviewed
  • [Journal Article] Reversible logic elements with memory and their universality2013

    • Author(s)
      K. Morita
    • Journal Title

      Electronic Proceedings in Theoretical Computer Science

      Volume: 128 Pages: 3-14

    • DOI

      10.4204/eptcs.128.3

    • Related Report
      2013 Research-status Report
  • [Journal Article] Brownian circuits: fundamentals2013

    • Author(s)
      F. Peper, J. Lee, J. Carmona, J. Cortadella, K. Morita
    • Journal Title

      ACM Journal on Emerging Technologies in Computing Systems

      Volume: 9 Issue: 1 Pages: 1-24

    • DOI

      10.1145/2422094.2422097

    • Related Report
      2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] A deterministic two-way multi-head finite automaton can be converted into a reversible one with the same number of heads2013

    • Author(s)
      K. Morita
    • Journal Title

      Lecture Notes in Computer Science

      Volume: 7581 Pages: 29-43

    • DOI

      10.1007/978-3-642-36315-3_3

    • ISBN
      9783642363146, 9783642363153
    • Related Report
      2012 Research-status Report
    • Peer Reviewed
  • [Journal Article] Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements2012

    • Author(s)
      J. Lee, R.L. Yang, K. Morita
    • Journal Title

      Theoretical Computer Science

      Volume: 460 Pages: 78-88

    • DOI

      10.1016/j.tcs.2012.07.027

    • Related Report
      2012 Research-status Report
    • Peer Reviewed
  • [Presentation] Reversible Turing machines with a small number of states2014

    • Author(s)
      K. Morita
    • Organizer
      6th Workshop on Non-Classical Models of Automata and Applications
    • Place of Presentation
      University of Kassel (Germany)
    • Year and Date
      2014-07-28 – 2014-07-29
    • Related Report
      2014 Annual Research Report
  • [Presentation] Language recognition by reversible partitioned cellular automata2014

    • Author(s)
      K. Morita
    • Organizer
      20th Int. Workshop on Cellular Automata and Discrete Complex Systems
    • Place of Presentation
      イーグレひめじ(姫路市)
    • Year and Date
      2014-07-07 – 2014-07-09
    • Related Report
      2014 Annual Research Report
  • [Presentation] Reversible logic elements with memory and their universality2013

    • Author(s)
      K. Morita
    • Organizer
      6th Conference on Machines, Computations and Universality
    • Place of Presentation
      Zurich, Switzerland
    • Related Report
      2013 Research-status Report
    • Invited
  • [Presentation] Reversible multi-head finite automata and space-bounded Turing machines2013

    • Author(s)
      K. Morita
    • Organizer
      京都大学数理解析研究所研究集会「理論計算機科学の新展開」
    • Place of Presentation
      京都
    • Related Report
      2012 Research-status Report
  • [Presentation] Universality of one-dimensional reversible and number-conserving cellular automata2012

    • Author(s)
      K. Morita
    • Organizer
      18th International Workshop on Cellular Automata and Discrete Complex Systems
    • Place of Presentation
      La Marana (France)
    • Related Report
      2012 Research-status Report
  • [Presentation] Reversible computing systems, logic circuits, and cellular automata2012

    • Author(s)
      K. Morita
    • Organizer
      3rd International Conference on Networking and Computing
    • Place of Presentation
      那覇
    • Related Report
      2012 Research-status Report
    • Invited
  • [Book] Automata, Universality, Computation (ed. A. Adamatzky) (Chapter 6: Constructing reversible Turing machines by reversible logic element with memory, DOI: 10.1007/978-3-319-09039-9_6)2015

    • Author(s)
      K. Morita
    • Total Pages
      418
    • Publisher
      Springer
    • Related Report
      2014 Annual Research Report
  • [Book] Handbook of Natural Computing (“Reversible cellular automata” by K. Morita, pp.232-257 を執筆)2012

    • Author(s)
      G. Rozenberg, T. Baeck, J.N. Kok (eds.)
    • Total Pages
      2100
    • Publisher
      Springer-Verlag
    • Related Report
      2012 Research-status Report
  • [Remarks] Language recognition by reversible CA:

    • URL

      http://ir.lib.hiroshima-u.ac.jp/00036074

    • Related Report
      2014 Annual Research Report
  • [Remarks] Reversible Turing machines with a few states:

    • URL

      http://ir.lib.hiroshima-u.ac.jp/00036075

    • Related Report
      2014 Annual Research Report
  • [Remarks] Realization of reversible Turing machines:

    • URL

      http://ir.lib.hiroshima-u.ac.jp/00036076

    • Related Report
      2014 Annual Research Report
  • [Remarks] Small universal reversible Turing machines:

    • URL

      http://ir.lib.hiroshima-u.ac.jp/00036736

    • Related Report
      2014 Annual Research Report
  • [Remarks] 1. A two-way multi-head finite automaton

    • URL

      http://ir.lib.hiroshima-u.ac.jp/00033875

    • Related Report
      2012 Research-status Report
  • [Remarks] 2. Universality of reversible cellular automata

    • URL

      http://ir.lib.hiroshima-u.ac.jp/00033876

    • Related Report
      2012 Research-status Report
  • [Remarks] 3. Reversible computing systems

    • URL

      http://ir.lib.hiroshima-u.ac.jp/00033877

    • Related Report
      2012 Research-status Report

URL: 

Published: 2013-05-31   Modified: 2023-03-16  

Information User Guide FAQ News Terms of Use Attribution of KAKENHI

Powered by NII kakenhi