2000 character limit reached
A converse to Moore's theorem on cellular automata
Published 26 Sep 2007 in math.CO, cs.IT, math.DS, math.GR, and math.IT | (0709.4280v1)
Abstract: We prove a converse to Moore's ``Garden-of-Eden'' theorem: a group G is amenable if and only if all cellular automata living on G that admit mutually erasable patterns also admit gardens of Eden. It had already been conjectured in that amenability could be characterized by cellular automata. We prove the first part of that conjecture.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.