Abstract
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.
This is a preview of subscription content, log in via an institution.
Buying options
Tax calculation will be finalised at checkout
Purchases are for personal use only
Learn about institutional subscriptionsPreview
Unable to display preview. Download preview PDF.
References
Adamatzky, A.: Collision-Based Computing. Springer (2002), doi:10.1007/978-1-4471-0129-1
Bennett, C.H.: Logical reversibility of computation. IBM J. Res. Dev. 17, 525–532 (1973), doi:10.1147/rd.176.0525
Bennett, C.H.: The thermodynamics of computation—a review. Int. J. Theoret. Phys. 21, 905–940 (1982), doi:10.1007/BF02084158
Büning, H., Priese, L.: Universal asynchronous iterative arrays of Mealy automata. Acta Informatica 13, 269–285 (1980), doi:10.1007/BF00288646
Fredkin, E., Toffoli, T.: Conservative logic. Int. J. Theoret. Phys. 21, 219–253 (1982), doi:10.1007/BF01857727
Keller, R.: Towards a theory of universal speed-independent modules. IEEE Trans. Computers C-23, 21–33 (1974), doi:10.1109/T-C.1974.223773
Lecerf, Y.: Machines de Turing réversibles — récursive insolubilité en n ∈ N de l’équation u = θ n u, où θ est un isomorphisme de codes. Comptes Rendus Hebdomadaires des Séances de L’académie des Sciences 257, 2597–2600 (1963)
Lee, J., Yang, R., Morita, K.: Design of 1-tape 2-symbol reversible Turing machines based on reversible logic elements. Theoret. Comput. Sci. 460, 78–88 (2012), doi:10.1016/j.tcs.2012.07.027
Margenstern, M.: Frontier between decidability and undecidability: a survey. Theoret. Comput. Sci. 231, 217–251 (2000), doi:10.1016/S0304-3975(99)00102-4
Morita, K.: A simple universal logic element and cellular automata for reversible computing. In: Margenstern, M., Rogozhin, Y. (eds.) MCU 2001. LNCS, vol. 2055, pp. 102–113. Springer, Heidelberg (2001)
Morita, K.: A new universal logic element for reversible computing. In: Martin-Vide, C., Mitrana, V. (eds.) Grammars and Automata for String Processing, pp. 285–294. Taylor & Francis, London (2003), doi:10.1201/9780203009642.ch28
Morita, K.: Reversible computing and cellular automata — A survey. Theoret. Comput. Sci. 395, 101–131 (2008), doi:10.1016/j.tcs.2008.01.041
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
Morita, K.: Reversible Computing. Kindai Kagaku-sha Co., Ltd., Tokyo (2012) ISBN 978-4-7649-0422-4 (in Japanese)
Morita, K., Ogiro, T., Alhazov, A., Tanizawa, T.: Non-degenerate 2-state reversible logic elements with three or more symbols are all universal. J. Multiple-Valued Logic and Soft Computing 18, 37–54 (2012)
Morita, K., Ogiro, T., Tanaka, K., Kato, H.: Classification and universality of reversible logic elements with one-bit memory. In: Margenstern, M. (ed.) MCU 2004. LNCS, vol. 3354, pp. 245–256. Springer, Heidelberg (2005)
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)
Mukai, Y., Ogiro, T., Morita, K.: Universality problems on reversible logic elements with 1-bit memory. Int. J. Unconventional Computing (to appear)
Toffoli, T.: Reversible computing. In: de Bakker, J.W., van Leeuwen, J. (eds.) ICALP 1980. LNCS, vol. 85, pp. 632–644. Springer, Heidelberg (1980)
Toffoli, T.: Bicontinuous extensions of invertible combinatorial functions. Math. Syst. Theory 14, 12–23 (1981), doi:10.1007/BF01752388
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 Springer International Publishing Switzerland
About this chapter
Cite this chapter
Morita, K. (2015). Constructing Reversible Turing Machines by Reversible Logic Element with Memory. In: Adamatzky, A. (eds) Automata, Universality, Computation. Emergence, Complexity and Computation, vol 12. Springer, Cham. https://doi.org/10.1007/978-3-319-09039-9_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-09039-9_6
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-09038-2
Online ISBN: 978-3-319-09039-9
eBook Packages: EngineeringEngineering (R0)