Abstract
We investigate a special type of cellular automata called elementary triangular partitioned cellular automata (ETPCAs) in which various interesting phenomena emerge. They are quite simple, since each of their local functions is specified by only four local transition rules. There are 256 ETPCAs in total, and 36 among them are reversible. Despite their extreme simplicity, some reversible ETPCAs show quite complex behavior, and they even have universal computing capability. In this survey, based on the author’s past results, we discuss how complex phenomena appear in these ETPCAs, and how high-order functions, such as reversible logic gates, are realized combining useful phenomena.
Currently, Professor Emeritus of Hiroshima University.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Adamatzky A (ed) (2002) Collision-based computing. Springer. https://doi.org/10.1007/978-1-4471-0129-1
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
Fredkin E, Toffoli T (1982) Conservative logic. Int J Theor 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. Theor Comput Sci 231:181–191. https://doi.org/10.1016/S0304-3975(99)00099-7
Morita K (2016) Universality of 8-state reversible and conservative triangular partitioned cellular automata. In: ACRI 2016 El Yacoubi S, et al (eds) LNCS, vol 9863, pp 45–54. https://doi.org/10.1007/978-3-319-44365-2_5. Slides with movies of computer simulation: Hiroshima University Institutional Repository, http://ir.lib.hiroshima-u.ac.jp/00039997
Morita K (2017) Finding a pathway from reversible microscopic laws to reversible computers. Int J Unconv Comput 13:203–213
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 (2017) Theory of reversible computing. Springer, Tokyo. https://doi.org/10.1007/978-4-431-56606-9
Morita K (2019) A universal non-conservative reversible elementary triangular partitioned cellular automaton that shows complex behavior. Nat Comput 18(3):413–428. https://doi.org/10.1007/s11047-017-9655-9. Slides with movies of computer simulation: Hiroshima University Institutional Repository, http://ir.lib.hiroshima-u.ac.jp/00039321
Morita K, Harao M (1989) Computation universality of one-dimensional reversible (injective) cellular automata. Trans IEICE Jpn E72:758–762
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/
Wolfram S (1986) Theory and applications of cellular automata. World Scientific Publishing
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2022 The Author(s), under exclusive license to Springer Nature Switzerland AG
About this chapter
Cite this chapter
Morita, K. (2022). Reversible Elementary Triangular Partitioned Cellular Automata and Their Complex Behavior. In: Adamatzky, A. (eds) Automata and Complexity. Emergence, Complexity and Computation, vol 42. Springer, Cham. https://doi.org/10.1007/978-3-030-92551-2_20
Download citation
DOI: https://doi.org/10.1007/978-3-030-92551-2_20
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-030-92550-5
Online ISBN: 978-3-030-92551-2
eBook Packages: EngineeringEngineering (R0)