Surjective cellular automata far from the Garden of Eden



: Silvio Capobianco, Pierre Guillon, Jarkko Kari

Publisher: Discrete Mathematics & Theoretical Computer Science

: 2013

: Discrete Mathematics and Theoretical Computer Science

: DMTCS

: 3

: 15

: 3

: 41

: 60

: 20

: 1462-7264

DOI: https://doi.org/10.46298/dmtcs.618

: https://dx.doi.org/10.46298/dmtcs.618

: https://research.utu.fi/converis/portal/detail/Publication/2052752


One of the first and most famous results of cellular automata theory, Moore’s Garden-of-Eden theorem has been proven to hold if and only if the underlying group possesses the measure-theoretic properties suggested by von Neumann to be the obstacle to the Banach-Tarski paradox. We show that several other results from the literature, already known to characterize surjective cellular automata in dimension d, hold precisely when the Garden-of-Eden theorem does. We focus in particular on the balancedness theorem, which has been proven by Bartholdi to fail on amenable groups, and we measure the amount of such failure.

Last updated on 2024-26-11 at 12:15