Advertisement

A Simple Universal Logic Element and Cellular Automata for Reversible Computing

  • Kenichi Morita
Conference paper
Part of the Lecture Notes in Computer Science book series (LNCS, volume 2055)

Abstract

Reversible computing is a paradigm of computation that reflects physical reversibility, and is considered to be important when designing a logical devices based on microscopic physical law in the near future. In this paper, we focus on a problem how universal computers can be built from primitive elements with very simple reversible rules. We introduce a new reversible logic element called a “rotary element”, and show that any reversible Turing machine can be realized as a circuit composed only of them. Such reversible circuits work in a very different fashion from conventional ones. We also discuss a simple reversible cellular automaton in which a rotary element can be implemented.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. 1.
    Bennett, C.H., Logical reversibility of computation, IBM J. Res. Dev., 17, 525–532 (1973).zbMATHCrossRefGoogle Scholar
  2. 2.
    Feynman, R.P., Feynman Lectures on Computation (eds., A.J.G. Hey and R.W. Allen), Perseus Books, Reading, Massachusetts (1996).Google Scholar
  3. 3.
    Fredkin, E. and Toffoli, T., Conservative logic, Int. J. Theoret. Phys., 21, 219–253 (1982).zbMATHCrossRefMathSciNetGoogle Scholar
  4. 4.
    Gruska, J., Quantum Computing, McGraw-Hill, London (1999).Google Scholar
  5. 5.
    Margolus, N., Physics-like model of computation, Physica, 10D, 81–95 (1984).MathSciNetGoogle Scholar
  6. 6.
    Morita, K., Shirasaki, A. and Gono, Y., A 1-tape 2-symbol reversible Turing machine, Trans. IEICE Japan, E-72, 223–228 (1989).Google Scholar
  7. 7.
    Morita, K., and Ueno, S., Computation-universal models of two-dimensional 16-state reversible cellular automata, IEICE Trans. Inf. &Syst., E75-D, 141–147 (1992).Google Scholar
  8. 8.
    Morita, K., Tojima, Y. and Imai, K.,A simple computer embedded in a reversible and number-conserving two-dimensional cellular space, Multiple-Valued Logic, (in press). Movie: http://www.ke.sys.hiroshima-u.ac.jp/”morita/p4/
  9. 9.
    Morita, K., A new universal logic element for reversible computing, Technical Report of IEICE Japan, COMP99-94 (2000).Google Scholar
  10. 10.
    Morita, K. and Ogiro T., Embedding a counter machine in a simple reversible 2-D cellular space, Proc. Int. Workshop on Cellular Automata, Osaka, 30–31 (2000). Movie: http://www.ke.sys.hiroshima-u.ac.jp/”morita/p3/
  11. 11.
    Păun, Gh., Rozenberg, G. and Salomaa, A., DNA Computing, Springer-Verlag, Berlin (1998).zbMATHGoogle Scholar
  12. 12.
    Toffoli, T., Reversible computing, in Automata, Languages and Programming, Springer-Verlag, LNCS-85, 632–644 (1980).Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

  • Kenichi Morita
    • 1
  1. 1.Faculty of EngineeringHiroshima UniversityHigashi-HiroshimaJapan

Personalised recommendations