Skip to Main content Skip to Navigation
Preprints, Working Papers, ...

Communication Complexity and Intrinsic Universality in Cellular Automata

Abstract : The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains hard in most of the cases. In this article, we introduce necessary conditions for a cellular automaton to be "universal", according to a precise notion of simulation, related both to the dynamics of cellular automata and to their computational power. This notion of simulation relies on simple operations of space-time rescaling and it is intrinsic to the model of cellular automata. Intrinsinc universality, the derived notion, is stronger than Turing universality, but more uniform, and easier to define and study. Our approach builds upon the notion of communication complexity, which was primarily designed to study parallel programs, and thus is, as we show in this article, particulary well suited to the study of cellular automata: it allowed to show, by studying natural problems on the dynamics of cellular automata, that several classes of cellular automata, as well as many natural (elementary) examples, could not be intrinsically universal.
Document type :
Preprints, Working Papers, ...
Complete list of metadata

Cited literature [13 references]  Display  Hide  Download
Contributor : Guillaume Theyssier Connect in order to contact the contributor
Submitted on : Wednesday, September 15, 2010 - 11:31:58 AM
Last modification on : Thursday, October 7, 2021 - 9:20:33 AM
Long-term archiving on: : Thursday, December 1, 2016 - 8:50:28 PM


Files produced by the author(s)


  • HAL Id : hal-00440186, version 4
  • ARXIV : 0912.1777




Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rapaport, Guillaume Theyssier. Communication Complexity and Intrinsic Universality in Cellular Automata. 2009. ⟨hal-00440186v4⟩



Record views


Files downloads