2000 character limit reached
A weakly universal cellular automaton in the heptagrid with three states
Published 7 Oct 2014 in cs.DM and nlin.CG | (1410.1864v1)
Abstract: In this paper, we construct a cellular automaton on the heptagrid which is planar, weakly universal and which have three states only. This result improves the best result which was with four states.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.
Top Community Prompts
Collections
Sign up for free to add this paper to one or more collections.