Abstract
We study a simple triangular partitioned cellular automaton (TPCA), and clarify its complex behavior. It is a CA with triangular cells, each of which is divided into three parts. The next state of a cell is determined by the three adjacent parts of its neighbor cells. This framework makes it easy to design reversible triangular CAs. Among them, isotropic and eight-state (i.e., each part has only two states) TPCAs are called elementary TPCAs (ETPCAs). They are extremely simple, since each of their local transition functions is described by only four local rules. In this paper, we investigate a specific reversible ETPCA \(T_{0347}\), where 0347 is its identification number in the class of 256 ETPCAs. In spite of the simplicity of the local function and the constraint of reversibility, evolutions of configurations in \(T_{0347}\) have very rich varieties. It is shown that a glider, which is a space-moving pattern, and glider guns exist in this cellular space We also show that the trajectory and the timing of a glider can be fully controlled by appropriately placing stable patterns called blocks. Furthermore, using gliders to represent signals, we can implement universal reversible logic gates in it. By this, computational universality of \(T_{0347}\) is derived.
Similar content being viewed by others
References
Bays C (1994) Cellular automata in the triangular tessellation. Complex Syst 8:127–150
Bennett CH (1973) Logical reversibility of computation. IBM J Res Dev 17:525–532. https://doi.org/10.1147/rd.176.0525
Berlekamp E, Conway J, Guy R (1982) Winning ways for your mathematical plays, vol 2. Academic Press, New York
Fredkin E, Toffoli T (1982) Conservative logic. Int J Theoret Phys 21:219–253. https://doi.org/10.1007/BF01857727
Gajardo A, Goles E (2001) Universal cellular automaton over a hexagonal tiling with 3 states. Int J Algebra Comput 11:335–354. https://doi.org/10.1142/S0218196701000486
Gardner M (1970) Mathematical games: the fantastic combinations of John Conway’s new solitaire game “life”. Sci Am 223(4):120–123. https://doi.org/10.1038/scientificamerican1070-120
Gardner M (1971) Mathematical games: on cellular automata, self-reproduction, the Garden of Eden and the game “life”. Sci Am 224(2):112–117. https://doi.org/10.1038/scientificamerican0271-112
Imai K, Morita K (2000) A computation-universal two-dimensional 8-state triangular reversible cellular automaton. Theoret Comput Sci 231:181–191. https://doi.org/10.1016/S0304-3975(99)00099-7
Margolus N (1984) Physics-like model of computation. Physica D 10:81–95. https://doi.org/10.1016/0167-2789(84)90252-5
Morita K (1990) A simple construction method of a reversible finite automaton out of Fredkin gates, and its related problem. Trans IEICE Jpn E–73:978–984
Morita K (2001) A simple reversible logic element and cellular automata for reversible computing. In: Margenstern M, Rogozhin Y (eds) MCU 2001, LNCS 2055, pp 102–113. https://doi.org/10.1007/3-540-45132-3_6
Morita K (2016a) A reversible elementary triangular partitioned cellular automaton that exhibits complex behavior (slides with simulation movies). Hiroshima University Institutional Repository. http://ir.lib.hiroshima-u.ac.jp/00039321
Morita K (2016b) Universality of 8-state reversible and conservative triangular partitioned cellular automata. In: El Yacoubi S et al (eds ) ACRI 2016, LNCS 9863, pp 45–54. https://doi.org/10.1007/978-3-319-44365-2_5
Morita K (2017) Reversible world: data set for simulating a reversible elementary triangular partitioned cellular automaton on Golly. Hiroshima University Institutional Repository. http://ir.lib.hiroshima-u.ac.jp/00042655
Morita K, Harao M (1989) Computation universality of one-dimensional reversible (injective) cellular automata. Trans IEICE Jpn E72:758–762
Morita K, Suyama R (2014) Compact realization of reversible Turing machines by 2-state reversible logic elements. In: Ibarra OH, Kari L, Kopecki S (eds) Proc. UCNC 2014, LNCS 8553, pp 280–292. https://doi.org/10.1007/978-3-319-08123-6_23, Slides with figures of computer simulation: Hiroshima University Institutional Repository. http://ir.lib.hiroshima-u.ac.jp/00036076
Morita K, Ueno S (1992) Computation-universal models of two-dimensional 16-state reversible cellular automata. IEICE Trans Inf Syst E75–D:141–147
Morita K, Tojima Y, Imai K, Ogiro T (2002) Universal computing in reversible and number-conserving two-dimensional cellular spaces. In: Adamatzky A (ed) Collision-based computing, Springer, pp 161–199. https://doi.org/10.1007/978-1-4471-0129-1_7
Morita K, Ogiro T, Alhazov A, Tanizawa T (2012) Non-degenerate 2-state reversible logic elements with three or more symbols are all universal. J Multiple-Valued Logic Soft Comput 18:37–54
Róka Z (1999) Simulations between cellular automata on Cayley graphs. Theoret Comput Sci 225:81–111. https://doi.org/10.1016/S0304-3975(97)00213-2
Trevorrow A, Rokicki T, et al (2005) Golly: an open source, cross-platform application for exploring Conway’s Game of Life and other cellular automata. http://golly.sourceforge.net/. A file for emulating \(T_{0347}\) (Reversible_World_2.zip) on Golly is available at the Rule Table Repository. http://github.com/GollyGang/ruletablerepository
Wolfram S (1986) Theory and applications of cellular automata. World Scientific Publishing, Singapore
Wolfram S (2002) A new kind of science. Wolfram Media Inc, Champaign
Acknowledgements
This work was supported by JSPS KAKENHI Grant Number JP15K00019.
Author information
Authors and Affiliations
Corresponding author
Additional information
This paper is an extended version of the paper presented in Cellular Automata and Discrete Complex Systems (eds. M. Cook and T. Neary), LNCS 9664, pp. 170–184 (2016).
Rights and permissions
About this article
Cite this article
Morita, K. A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior. Nat Comput 18, 413–428 (2019). https://doi.org/10.1007/s11047-017-9655-9
Published:
Issue Date:
DOI: https://doi.org/10.1007/s11047-017-9655-9