Skip to main contentSkip to search
Episciences
Open Access Journals
Sign in(new window)
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Discrete Mathematics & Theoretical Computer Science logo
Discrete Mathematics & Theoretical Computer Science
Sign in(new window)
Articles & Issues
All articlesAll accepted articlesAll volumesLast volumeSectionsSpecial issuesAuthors
About
The journalIndexing
Boards
Publish
For authorsEthical charter
Submit
Discrete Mathematics & Theoretical Computer Science logo
Contact
|
Credits
eISSN 1365-8050
|
RSS
|
Atom
Episciences
Documentation
|
Acknowledgements
|
Publishing policy
Accessibility: non-compliant
|
Legal mentions
|
Privacy statement
|
Terms of use
  1. Home > Articles & Issues >
  2. Articles >
  3. Surjective cellular ...
Article

Surjective cellular automata far from the Garden of Eden

Silvio Capobianco ORCID (1), Pierre Guillon ORCID (2) (3), Jarkko Kari ORCID (2)
(1) Institute of Cybernetics [Tallinn]
(2) Department of Mathematics
(3) Institut de mathématiques de Luminy
Download article
Open on HAL
Imported on
December 6, 2012
Published on
October 17, 2013
Last modified on
March 31, 2025
Volume 15
vol. 15:3
Automata, Logic and Semantics
DOI
10.46298/dmtcs.618
License
https://about.hal.science/hal-authorisation-v1
Research Council of Finland
131558
Cellular automata and discrete dynamical systems
Indicators
992
Views
1411
Downloads

Surjective cellular automata far from the Garden of Eden

Silvio Capobianco ORCID (1), Pierre Guillon ORCID (2) (3), Jarkko Kari ORCID (2)
(1) Institute of Cybernetics [Tallinn]
(2) Department of Mathematics
(3) Institut de mathématiques de Luminy
Abstract
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.
Keywords
  • [INFO.INFO-DM]Computer Science [cs]/Discrete Mathematics [cs.DM]
Cited by

Source: OpenCitations

  • Cold dynamics in cellular automata: a tutorial

    arXiv (Cornell University)

    Authors : Guillaume Theyssier

    Journal reference : Volume 21, 2022, pp. 481-505

    DOI : 10.1007/s11047-022-09886-2
Preview
Loading PDF preview...