Probabilistic Cellular Automata

Béla Bollobás
University of Cambridge

In the talk I shall review some of the assertions about probabilistic
cellular automata, and shall present a number of rigorous results obtained
jointly with Paul Balister, Robert Johnson and Mark Walters.
These theorems, which are far beyond anything obtainable by simulation,
provide evidence for the existence of critical probabilities for the
random majority-vote cellular automata on tori.

Back to Workshop I: Probabilistic Techniques and Applications