Corpus ID: 14317346

A converse to Moore's theorem on cellular automata

@article{Bartholdi2007ACT,
  title={A converse to Moore's theorem on cellular automata},
  author={L. Bartholdi},
  journal={ArXiv},
  year={2007},
  volume={abs/0709.4280}
}
  • L. Bartholdi
  • Published 2007
  • Mathematics, Computer Science
  • ArXiv
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. 

References

SHOWING 1-10 OF 11 REFERENCES
The converse of Moore’s Garden-of-Eden theorem
  • 245
  • PDF
Garden of Eden Configurations for Cellular Automata on Cayley Graphs of Groups
  • 63
Endomorphisms of symbolic algebraic varieties
  • 272
  • Highly Influential
  • PDF
Amenable groups and cellular automata
  • 64
  • PDF
Amenable groups and cellular automata, Ann
  • Inst. Fourier (Grenoble)
  • 1999
gromov:endomorphisms2M. Gromov, Endomorphisms of symbolic algebraic varieties
  • J. Eur. Math. Soc. (JEMS)
  • 1999
Arrays, Automata and Groups: Some Interconnections
  • P. Schupp
  • Computer Science
  • Automata Networks
  • 1986
  • 5
Schupp, Arrays, automata and groups—some interconnections, Automata networks Argeì es-Village
  • Lecture Notes in Comput. Sci
  • 1986
Machine models of self-reproduction, Essays on cellular automata
  • Machine models of self-reproduction, Essays on cellular automata
  • 1970
Machine Models of Self-Reproduction
  • 409
...
1
2
...