Computer Science – Computational Complexity
Scientific paper
2009-06-17
EPTCS 1, 2009, pp. 81-92
Computer Science
Computational Complexity
Scientific paper
10.4204/EPTCS.1.8
The goal of this paper is to show why the framework of communication complexity seems suitable for the study of cellular automata. Researchers have tackled different algorithmic problems ranging from the complexity of predicting to the decidability of different dynamical properties of cellular automata. But the difference here is that we look for communication protocols arising in the dynamics itself. Our work is guided by the following idea: if we are able to give a protocol describing a cellular automaton, then we can understand its behavior.
Goles Eric
Meunier Pierre-Etienne
Rapaport Iván
Theyssier Guillaume
No associations
LandOfFree
Communications 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 Communications in cellular automata, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Communications in cellular automata will most certainly appreciate the feedback.
Profile ID: LFWR-SCP-O-223954