On Local Symmetries And Universality In Cellular Autmata

dc.creatorBoyer, Laurent
dc.creatorTheyssier, Guillaume
dc.date2009-02-07
dc.date.accessioned2026-07-07T12:39:20Z
dc.date.available2026-07-07T12:39:20Z
dc.descriptionCellular automata (CA) are dynamical systems defined by a finite local rule but they are studied for their global dynamics. They can exhibit a wide range of complex behaviours and a celebrated result is the existence of (intrinsically) universal CA, that is CA able to fully simulate any other CA. In this paper, we show that the asymptotic density of universal cellular automata is 1 in several families of CA defined by local symmetries. We extend results previously established for captive cellular automata in two significant ways. First, our results apply to well-known families of CA (e.g. the family of outer-totalistic CA containing the Game of Life) and, second, we obtain such density results with both increasing number of states and increasing neighbourhood. Moreover, thanks to universality-preserving encodings, we show that the universality problem remains undecidable in some of those families.
dc.identifierhttps://arxiv.org/abs/0902.1253
dc.identifierhttp://arxiv.org/abs/0902.1253
dc.identifier26th International Symposium on Theoretical Aspects of Computer Science STACS 2009 (2009) 195-206
dc.identifier.urihttp://salesiana.dossiersoluciones.com/handle/123456789/219071
dc.subjectDiscrete Mathematics
dc.subjectDynamical Systems
dc.titleOn Local Symmetries And Universality In Cellular Autmata
dc.typetext

Files

Collections