| Article ID | Journal | Published Year | Pages | File Type |
|---|---|---|---|---|
| 438125 | Theoretical Computer Science | 2014 | 31 Pages |
Abstract
We survey probabilistic cellular automata with approaches coming from combinatorics, statistical physics, and theoretical computer science, each bringing a different viewpoint. Some of the questions studied are specific to a domain, and some others are shared, most notably the ergodicity problem.
Related Topics
Physical Sciences and Engineering
Computer Science
Computational Theory and Mathematics
Authors
Jean Mairesse, Irène Marcovici,