Papers
Topics
Authors
Recent
Search
2000 character limit reached

A weakly universal cellular automaton on the tessellation $\{9,3\}$

Published 31 May 2016 in cs.DM and nlin.CG | (1605.09518v1)

Abstract: In this paper, we construct a weakly universal cellular automaton on the tessellation ${9,3}$ which has two states and which is not rotation invariant but which is truly planar.

Citations (5)
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