Papers
Topics
Authors
Recent
Search
2000 character limit reached

A weakly universal cellular automaton on the pentagrid with two states

Published 25 Dec 2015 in cs.DM and nlin.CG | (1512.07988v2)

Abstract: 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 \textit{`a 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.

Citations (4)

Summary

No one has generated a summary of this paper yet.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

No one has generated a whiteboard explanation for this paper yet.

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Continue Learning

We haven't generated follow-up questions for this paper yet.

Authors (1)

Collections

Sign up for free to add this paper to one or more collections.