Simulation of Gacs' Automaton

Abstract

Peter Gacs proposed a one-dimensional cellular automaton capable of a robust self-reproduction. Because the automaton is exceptionally large and complicated, very few people have ever succeeded in simulating it on a computer or analyzing its behavior. Here we demonstrate a partial simulation of Gacs' automaton (of Gray's version), discussing its robustness. We also discuss the potential applications of Gacs' framework.