Abstract
We show the existence of Turing-universal and intrinsically universal cellular automata exhibiting both time symmetry and number conservation; this is achieved by providing a way to simulate reversible CA with time-symmetric CA, which preserves the number-conserving property. We also provide some additional results and observations concerning the simulation relations between reversible, time-symmetric and number-conserving CA in the context of partitioned CA.
This work was partially supported by CONICYT-Chile through BASAL project CMM, Universidad de Chile, and FONDECYT project# 1140833.
Chapter PDF
Similar content being viewed by others
Keywords
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
References
Cassaigne, J., Ollinger, N., Torres-Avilés, R.: A Small Minimal Aperiodic Reversible Turing Machine (2014). https://hal.inria.fr/hal-00975244
Delorme, M., Mazoyer, J., Ollinger, N., Theyssier, G.: Bulking II: classifications of cellular automata. Theoretical Computer Science 412(30), 3881–3095 (2011)
Durand-Lose, J.: Intrinsic universality of a 1-dimensional reversible cellular automaton. In: Reischuk, R., Morvan, M. (eds.) STACS 1997. LNCS, vol. 1200, pp. 439–450. Springer, Heidelberg (1997)
Gajardo, A., Kari, J., Moreira, A.: On time-symmetry in cellular automata. Journal of Computer and System Sciences 78(4), 1115–1126 (2012)
Kari, J.: Reversible cellular automata. In: De Felice, C., Restivo, A. (eds.) DLT 2005. LNCS, vol. 3572, pp. 57–68. Springer, Heidelberg (2005)
Kari, J., Ollinger, N.: Periodicity and immortality in reversible computing. In: Ochmański, E., Tyszkiewicz, J. (eds.) MFCS 2008. LNCS, vol. 5162, pp. 419–430. Springer, Heidelberg (2008)
Moreira, A.: Universality and decidability of number-conserving cellular automata. Theoretical Computer Science 292(3), 711–721 (2003)
Morita, K.: Computation-universality of one-dimensional one-way reversible cellular automata. Information Processing Letters 42(6), 325–329 (1992)
Morita, K.: Reversible computing and cellular automata: A survey. Theoretical Computer Science 395(1), 101–131 (2008)
Morita, K.: Universality of one-dimensional reversible and number-conserving cellular automata. In: Formenti, E. (ed.) AUTOMATA JAC. EPTCS, vol. 90, pp. 142–150 (2012)
Morita, K., Harao, M.: Computation-universality of one-dimensional reversible (injective) cellular automata. The Transactions of the IEICE 72(6), 758–762 (1989)
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2015 IFIP International Federation for Information Processing
About this paper
Cite this paper
Maldonado, D., Moreira, A., Gajardo, A. (2015). Universal Time-Symmetric Number-Conserving Cellular Automaton. In: Kari, J. (eds) Cellular Automata and Discrete Complex Systems. AUTOMATA 2015. Lecture Notes in Computer Science(), vol 9099. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-662-47221-7_12
Download citation
DOI: https://doi.org/10.1007/978-3-662-47221-7_12
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-662-47220-0
Online ISBN: 978-3-662-47221-7
eBook Packages: Computer ScienceComputer Science (R0)