Compact Realization of Reversible Turing Machines by 2-State Reversible Logic Elements
A reversible logic element with memory (RLEM) is a primitive by which reversible computing systems can be constructed. Different from a reversible logic gate, it has a finite memory, and thus is defined as a kind of reversible sequential machine (RSM). It is known that any reversible Turing machine (RTM) can be built in a simple way using a rotary element (RE), a typical 2-state RLEM (i.e., having 1-bit memory) with four input/output lines. In this paper, we show another compact realization of an RTM using a 2-state RLEM No. 4-31 with four input/output lines. Since RLEM 4-31 can be simulated by a circuit composed of only two copies of 2-state RLEM 3-7, we also obtain another compact realization by an RLEM with three input/output lines.
KeywordsOutput Port Input Port Reversible Logic Input Symbol Output Symbol
Unable to display preview. Download preview PDF.
- 3.Lee, J., Peper, F., Adachi, S., Morita, K.: An asynchronous cellular automaton implementing 2-state 2-input 2-output reversed-twin reversible elements. In: Umeo, H., Morishita, S., Nishinari, K., Komatsuzaki, T., Bandini, S. (eds.) ACRI 2008. LNCS, vol. 5191, pp. 67–76. Springer, Heidelberg (2008)CrossRefGoogle Scholar
- 7.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
- 8.Morita, K.: Reversible Computing. Kindai Kagaku-sha Co., Ltd., Tokyo (2012) (in Japanese) ISBN 978-4-7649-0422-4Google Scholar
- 11.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
- 12.Mukai, Y., Ogiro, T., Morita, K.: Universality problems on reversible logic elements with 1-bit memory. Int. J. Unconventional Computing (to appear)Google Scholar