A strongly universal cellular automaton in the dodecagrid with five states
Maurice Margenstern
TL;DR
This paper presents a five-state, rotation-invariant, strongly universal cellular automaton in the hyperbolic 3D dodecagrid, improving previous automata that required more states.
Contribution
The paper introduces a new minimal-state automaton in the hyperbolic dodecagrid, reducing the number of states from ten to five while maintaining strong universality.
Findings
Automaton is strongly universal in the hyperbolic dodecagrid.
Automaton is rotation invariant.
Number of states reduced from ten to five.
Abstract
In this paper, we prove that there is a strongly universal cellular automaton in the dodecagrid, the tessellation {5,3,4} of the hyperbolic 3D-space, with five states which is rotation invariant. This improves a previous paper of the author where the automaton required ten states.
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsCellular Automata and Applications · Algorithms and Data Compression · Computability, Logic, AI Algorithms