Surjective cellular automata far from the Garden of Eden

dc.contributor.authorSilvio Capobianco
dc.contributor.authorPierre Guillon
dc.contributor.authorJarkko Kari
dc.contributor.organizationfi=matematiikka|en=Mathematics|
dc.contributor.organization-code1.2.246.10.2458963.20.41687507875
dc.converis.publication-id2052752
dc.converis.urlhttps://research.utu.fi/converis/portal/Publication/2052752
dc.date.accessioned2022-10-28T13:40:22Z
dc.date.available2022-10-28T13:40:22Z
dc.description.abstractOne 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.
dc.format.pagerange41
dc.format.pagerange60
dc.identifier.jour-issn1462-7264
dc.identifier.olddbid183520
dc.identifier.oldhandle10024/166614
dc.identifier.urihttps://www.utupub.fi/handle/11111/40813
dc.identifier.urlhttps://dx.doi.org/10.46298/dmtcs.618
dc.identifier.urnURN:NBN:fi-fe2021042714434
dc.language.isoen
dc.okm.affiliatedauthorKari, Jarkko
dc.okm.discipline111 Mathematicsen_GB
dc.okm.discipline113 Computer and information sciencesen_GB
dc.okm.discipline111 Matematiikkafi_FI
dc.okm.discipline113 Tietojenkäsittely ja informaatiotieteetfi_FI
dc.okm.internationalcopublicationinternational co-publication
dc.okm.internationalityInternational publication
dc.okm.typeA1 ScientificArticle
dc.publisherDiscrete Mathematics & Theoretical Computer Science
dc.publisher.countryUnited Kingdomen_GB
dc.publisher.countryBritanniafi_FI
dc.publisher.country-codeGB
dc.relation.doi10.46298/dmtcs.618
dc.relation.ispartofjournalDiscrete Mathematics and Theoretical Computer Science
dc.relation.issue3
dc.relation.volume15
dc.source.identifierhttps://www.utupub.fi/handle/10024/166614
dc.titleSurjective cellular automata far from the Garden of Eden
dc.year.issued2013

Tiedostot

Näytetään 1 - 1 / 1
Ladataan...
Name:
4359.pdf
Size:
413.25 KB
Format:
Adobe Portable Document Format