2015/12/25 by Maurice Margenstern, Margenstern, Maurice
Computer Science · Physics and Astronomy · #68R05 #Cellular Automata and Lattice Gases (nlin.CG) #Discrete Mathematics (cs.DM) #F.2.2 #FOS: Computer and information sciences #FOS: Physical sciences #acm:68R05 #cs.DM #msc:68R05 #nlin.CG
paper · pdf · doi:10.48550/arxiv.1512.07988
38 pages 24 figures. arXiv admin note: text overlap with arXiv:1510.09129
arxiv created 2016/02/13 · arxiv updated 2016/02/16
In this paper, we prove that there is a weakly universal cellular automaton on the pentagrid with two states. This paper improves in some sense a previous result with three states. Both results make use of à la Moore neighbourhood. However, the result with three states is rotation invariant while that with two states is not. In both cases, at each step of the computation, the set of non quiescent states has always infinitely many cycles.