Traced communication complexity of cellular automata

@article{Ch2011TracedCC,
  title={Traced communication complexity of cellular automata},
  author={E. Ch. and Pierre Guillon and I. Rapaport},
  journal={ArXiv},
  year={2011},
  volume={abs/1102.3522}
}
  • E. Ch., Pierre Guillon, I. Rapaport
  • Published 2011
  • Computer Science, Mathematics
  • ArXiv
  • We study cellular automata with respect to a new communication complexity problem: each of two players know half of some finite word, and must be able to tell whether the state of the central cell will follow a given evolution, by communicating as little as possible between each other. We present some links with classical dynamical concepts, especially equicontinuity, expansivity, entropy and give the asymptotic communication complexity of most elementary cellular automata. 
    2 Citations
    Communication complexity in number-conserving and monotone cellular automata
    • 8
    • PDF
    Computing with Sand: On the Complexity of Recognizing Two-dimensional Sandpile Critical Configurations

    References

    SHOWING 1-10 OF 15 REFERENCES
    Cellular automata and communication complexity
    • 24
    • PDF
    Ultimate Traces of Cellular Automata
    • 7
    • PDF
    Bulking II: Classifications of cellular automata
    • 41
    • PDF
    Communication complexity and intrinsic universality in cellular automata
    • 25
    • PDF
    Languages, equicontinuity and attractors in cellular automata
    • 225
    Row Subshifts and Topological Entropy of Cellular Automata
    • 6
    • Highly Influential
    • PDF
    On rank vs. communication complexity
    • N. Nisan, A. Wigderson
    • Computer Science, Mathematics
    • Proceedings 35th Annual Symposium on Foundations of Computer Science
    • 1994
    • 99
    • PDF
    Communication Complexity
    • 647
    • PDF