5 citations · 15 across the 23 of their papers we have counts for
Showing 2009Show all
2 papers · 1 filter
cs.DM2009
Communication Complexity and Intrinsic Universality in Cellular Automata
Eric Goles Chacc, Pierre-Etienne Meunier, Ivan Rapaport +1
The notions of universality and completeness are central in the theories of computation and computational complexity. However, proving lower bounds and necessary conditions remains…
cs.CC2009★ 4 cited
Communications in cellular automata
Eric Goles, Pierre-Etienne Meunier, Ivan Rapaport +1
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 pr…