Papers
Topics
Authors
Recent
Search
2000 character limit reached

A weakly universal cellular automaton on the pentagrid with three states

Published 30 Oct 2015 in cs.DM and nlin.CG | (1510.09129v1)

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.

Citations (3)
View on Semantic Scholar

Summary

No one has generated a summary of this paper yet.

Sign Up to Summarize

Paper to Video (Beta)

No one has generated a video about this paper yet.

Sign Up to Generate All Videos Subscribe on YouTube

Whiteboard

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

Sign Up to Generate

Open Problems

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

Generate Now

Continue Learning

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

Generate Now

Authors (1)

  1. Maurice Margenstern 

Collections

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

Sign Up