2000 character limit reached
About Strongly Universal Cellular Automata (1304.6316v2)
Published 23 Apr 2013 in cs.DM and nlin.CG
Abstract: In this paper, we construct a strongly universal cellular automaton on the line with 11 states and the standard neighbourhood. We embed this construction into several tilings of the hyperbolic plane and of the hyperbolic 3D space giving rise to strongly universal cellular automata with 10 states.
Collections
Sign up for free to add this paper to one or more collections.
Paper Prompts
Sign up for free to create and run prompts on this paper using GPT-5.