## Abstract

We consider the typical asymptotic behaviour of cellular automata of higher dimension (≥2). That is, we take an initial configuration at random according to a Bernoulli (i.i.d) probability measure, iterate some cellular automaton, and consider the (set of) limit probability measure(s) as t → ∞. In this paper, we prove that limit measures that can be reached by higher-dimensional cellular automata are completely characterised by computability conditions, as in the one-dimensional case. This implies that cellular automata have the same variety and complexity of typical asymptotic behaviours as Turing machines, and that any nontrivial property in this regard is undecidable (Rice-type theorem). These results extend to connected sets of limit measures and Cesàro mean convergence. The main tool is the implementation of arbitrary computation in the time evolution of a cellular automata in such a way that it emerges and self-organises from a random configuration.

Original language | English |
---|---|

Pages (from-to) | 1-36 |

Number of pages | 36 |

Journal | Theory of Computing Systems |

DOIs | |

Publication status | Accepted/In press - 7 Mar 2017 |

Externally published | Yes |

## Keywords

- Cellular automata
- Computability
- Limit measure
- Multidimensional
- Symbolic dynamics

## ASJC Scopus subject areas

- Theoretical Computer Science
- Computational Theory and Mathematics