Papers
Topics
Authors
Recent
Assistant
AI Research Assistant
Well-researched responses based on relevant abstracts and paper content.
Custom Instructions Pro
Preferences or requirements that you'd like Emergent Mind to consider when generating responses.
Gemini 2.5 Flash
Gemini 2.5 Flash 171 tok/s
Gemini 2.5 Pro 41 tok/s Pro
GPT-5 Medium 28 tok/s Pro
GPT-5 High 31 tok/s Pro
GPT-4o 92 tok/s Pro
Kimi K2 202 tok/s Pro
GPT OSS 120B 435 tok/s Pro
Claude Sonnet 4.5 35 tok/s Pro
2000 character limit reached

Characterisation of limit measures of higher-dimensional cellular automata (1512.03696v2)

Published 11 Dec 2015 in math.DS, cs.FL, and nlin.CG

Abstract: We consider the typical asymptotic behaviour of cellular automata of higher dimension (greater than 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 time tends to infinity. 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`aro 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.

Citations (4)

Summary

We haven't generated a summary for this paper yet.

Lightbulb Streamline Icon: https://streamlinehq.com

Continue Learning

We haven't generated follow-up questions for this paper yet.

List To Do Tasks Checklist Streamline Icon: https://streamlinehq.com

Collections

Sign up for free to add this paper to one or more collections.