2000 character limit reached
A weakly universal cellular automaton on the pentagrid with three states (1510.09129v1)
Published 30 Oct 2015 in cs.DM and nlin.CG
Abstract: In this paper, we prove that there is a weakly universal cellular automaton on the pentagrid with three states which is rotation invariant and which uses `a la Moore neighbourhood. Moreover, at each step of the computation, the set of non quiescent states has always infinitely many cycles.