A Simple Universal Logic Element and Cellular Automata for Reversible Computing

  • Kenichi Morita
Conference paper

DOI: 10.1007/3-540-45132-3_6

Volume 2055 of the book series Lecture Notes in Computer Science (LNCS)
Cite this paper as:
Morita K. (2001) A Simple Universal Logic Element and Cellular Automata for Reversible Computing. In: Margenstern M., Rogozhin Y. (eds) Machines, Computations, and Universality. MCU 2001. Lecture Notes in Computer Science, vol 2055. Springer, Berlin, Heidelberg

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.

Copyright information

© Springer-Verlag Berlin Heidelberg 2001

Authors and Affiliations

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