Constructing Reversible Turing Machines by Reversible Logic Element with Memory
A reversible logic element is a primitive for composing reversible computing machines. There are two kinds of such elements, i.e., one without memory, which is commonly called a reversible logic gate, and one with memory. It is known that, in reversible computing, a reversible logic element with memory is useful as well as a reversible logic gate, since reversible computing machines can be constructed simply using such a type of elements. A rotary element (RE) is a typical instance of a reversible logic element with 1-bit memory, whose operations can be easily understood by an intuitive interpretation. In this survey, we discuss how RE is implemented in an idealized reversible physical system, and how reversible Turing machines (RTMs) can be constructed from REs. In particular, we give a new simpler construction method of RTMs than the previous one.
KeywordsMemory Cell Reversible Logic Read Operation Input Symbol Output Symbol
Unable to display preview. Download preview PDF.
- 1.Adamatzky, A.: Collision-Based Computing. Springer (2002), doi:10.1007/978-1-4471-0129-1Google Scholar
- 13.Morita, K.: Constructing a reversible Turing machine by a rotary element, a reversible logic element with memory. Hiroshima University Institutional Repository (2010), http://ir.lib.hiroshima-u.ac.jp/00029224
- 14.Morita, K.: Reversible Computing. Kindai Kagaku-sha Co., Ltd., Tokyo (2012) ISBN 978-4-7649-0422-4 (in Japanese)Google Scholar
- 17.Mukai, Y., Morita, K.: Realizing reversible logic elements with memory in the billiard ball model. Int. J. of Unconventional Computing 8(1), 47–59 (2012)Google Scholar
- 18.Mukai, Y., Ogiro, T., Morita, K.: Universality problems on reversible logic elements with 1-bit memory. Int. J. Unconventional Computing (to appear)Google Scholar