Access the full text.
Sign up today, get DeepDyve free for 14 days.
Loading next page...
/lp/springer-journals/automata-and-complexity-the-mirage-of-universality-in-cellular-IS9KWpHISe
References (23)
-
M. Delorme, J. Mazoyer (1999)
Cellular automata : a parallel model -
E. Goles, Nicolas Ollinger, Guillaume Theyssier (2015)
Introducing Freezing Cellular Automata -
E. Goles, Pedro Montealegre, Kévin Perrot, Guillaume Theyssier (2018)
On the complexity of two-dimensional signed majority cellular automataJ. Comput. Syst. Sci., 91
-
M. Delacourt (2011)
Rice's Theorem for μ-Limit Sets of Cellular Automata -
E. Ch., Pierre-Etienne Meunier, I. Rapaport, Guillaume Theyssier (2009)
Communication complexity and intrinsic universality in cellular automataTheor. Comput. Sci., 412
-
Martin Kutrib, Andreas Malcher (2009)
Cellular automata with sparse communicationTheor. Comput. Sci., 411
-
G. Hedlund (1969)
Endomorphisms and automorphisms of the shift dynamical systemMathematical systems theory, 3
-
J. Durand-Lose (2009)
Universality of Cellular Automata -
R. Vollmar (1981)
On Cellular Automata with a Finite Number of State Changes -
Pierre Guillon, Pierre-Etienne Meunier, Guillaume Theyssier (2010)
Clandestine Simulations in Cellular Automata -
L. Hurd (1990)
Nonrecursive Cellular Automata Invariant SetsComplex Syst., 4
-
Nicolas Ollinger, Guillaume Theyssier (2019)
Freezing, Bounded-Change and Convergent Cellular AutomataArXiv, abs/1908.06751
-
Nicolas Ollinger (2008)
Universalities in cellular automata a (short) survey -
M. Delorme, J. Mazoyer, Nicolas Ollinger, Guillaume Theyssier (2011)
Bulking I: An abstract theory of bulkingTheor. Comput. Sci., 412
-
P. Kurka (2003)
Topological and symbolic dynamics -
M. Delorme, J. Mazoyer, Nicolas Ollinger, Guillaume Theyssier (2010)
Bulking II: Classifications of cellular automataTheor. Comput. Sci., 412
-
J. Delvenne, P. Kurka, V. Blondel (2004)
Decidability and Universality in Symbolic Dynamical SystemsFundam. Informaticae, 74
-
Olivier Carton, B. Guillon, Fabian Reiter (2018)
Counter Machines and Distributed Automata: A Story about Exchanging Space and TimeArXiv, abs/1804.03582
-
Turlough Neary, D. Woods (2006)
P-completeness of Cellular Automaton Rule 110 -
K. Culík, J. Pachl, Sheng Yu (1989)
On the Limit Sets of Cellular AutomataSIAM J. Comput., 18
-
E. Ch., A. Maass, A. ServetMartínez (1993)
On the Limit Set of Some Universal Cellular AutomataTheor. Comput. Sci., 110
-
Matthew Cook (2004)
Universality in Elementary Cellular AutomataComplex Syst., 15
-
M. Minsky (1967)
Computation: Finite and Infinite Machines
- Publisher
- Springer International Publishing
- Copyright
- © The Editor(s) (if applicable) and The Author(s), under exclusive license to Springer Nature Switzerland AG 2022
- ISBN
- 978-3-030-92550-5
- Pages
- 57 –70
- DOI
- 10.1007/978-3-030-92551-2_5
- Publisher site
- See Chapter on Publisher Site
Abstract
[This note is a survey of examples and results about cellular automata with the purpose of recalling that there is no ‘universal’ way of being computationally universal. In particular, we show how some cellular automata can embed efficient but bounded computation, while others can embed unbounded computations but not efficiently. We also study two variants of Boolean circuit embedding, transient versus repeatable simulations, and underline their differences. Finally we show how strong forms of universality can be hidden inside some seemingly simple cellular automata according to some classical dynamical parameters.]
Published: Apr 20, 2022