Communications in cellular automata

Communications in cellular automata

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 autom...

Full description

Bibliographic Details
Main Authors: Guillaume Theyssier, Ivan Rapaport, Eric Goles, Pierre-Etienne Meunier
Format: Article
Language:English
Published: Open Publishing Association 2009-06-01
Series:Electronic Proceedings in Theoretical Computer Science
Online Access:http://arxiv.org/pdf/0906.3284v1
id doaj-c99e0187f83c4ca0aa369b354d650d23
record_format Article
spelling doaj-c99e0187f83c4ca0aa369b354d650d232020-11-24T23:02:48ZengOpen Publishing AssociationElectronic Proceedings in Theoretical Computer Science2075-21802009-06-011Proc. CSP 2008819210.4204/EPTCS.1.8Communications in cellular automataGuillaume TheyssierIvan RapaportEric GolesPierre-Etienne MeunierThe 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. http://arxiv.org/pdf/0906.3284v1
collection DOAJ
language English
format Article
sources DOAJ
author Guillaume Theyssier
Ivan Rapaport
Eric Goles
Pierre-Etienne Meunier
spellingShingle Guillaume Theyssier
Ivan Rapaport
Eric Goles
Pierre-Etienne Meunier
Communications in cellular automata
Electronic Proceedings in Theoretical Computer Science
author_facet Guillaume Theyssier
Ivan Rapaport
Eric Goles
Pierre-Etienne Meunier
author_sort Guillaume Theyssier
title Communications in cellular automata
title_short Communications in cellular automata
title_full Communications in cellular automata
title_fullStr Communications in cellular automata
title_full_unstemmed Communications in cellular automata
title_sort communications in cellular automata
publisher Open Publishing Association
series Electronic Proceedings in Theoretical Computer Science
issn 2075-2180
publishDate 2009-06-01
description 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.
url http://arxiv.org/pdf/0906.3284v1
work_keys_str_mv AT guillaumetheyssier communicationsincellularautomata
AT ivanrapaport communicationsincellularautomata
AT ericgoles communicationsincellularautomata
AT pierreetiennemeunier communicationsincellularautomata
_version_ 1725635106604843008

Similar Items