A converse to Moore's theorem on cellular automata

Laurent Bartholdi

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.

Knowledge Graph

arrow_drop_up

Comments

Sign up or login to leave a comment