Computer Science – Discrete Mathematics
Scientific paper
2009-12-09
Computer Science
Discrete Mathematics
Scientific paper
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.
Chacc Eric Goles
Meunier Pierre-Etienne
Rapaport Iván
Theyssier Guillaume
No associations
LandOfFree
Communication Complexity and Intrinsic Universality in Cellular Automata does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.
If you have personal experience with Communication Complexity and Intrinsic Universality in Cellular Automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Communication Complexity and Intrinsic Universality in Cellular Automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-276387