[Paper Review] A weakly universal cellular automaton in the hyperbolic 3D space with three states

Maurice Margenstern|arXiv (Cornell University)|Feb 23, 2010

Cellular Automata and Applications9 references4 citations

TL;DR

This paper presents a weakly universal cellular automaton in the hyperbolic 3D space (dodecagrid) using only three states, achieving universality through a novel track implementation based on milestones rather than continuous tracks. The model uses a railway circuit-inspired design with memory, flip-flop, and fixed switches, leveraging 3D geometry to eliminate crossings via bridges, and is validated via a custom simulation program that confirms rotational invariance and correctness of the rule set.

ABSTRACT

In this paper, we significantly improve a previous result by the same author showing the existence of a weakly universal cellular automaton with five states living in the hyperbolic 3D-space. Here, we get such a cellular automaton with three states only.

Motivation & Objective

• To reduce the number of states required for weak universality in hyperbolic 3D cellular automata from five to three.
• To develop a 3D implementation of the railway model that avoids planar crossing issues by utilizing spatial depth.
• To demonstrate that the automaton is truly three-dimensional, with motion and structure that cannot be reduced to lower dimensions.
• To validate the rule set through a custom simulation program that checks rotational invariance and correct behavior across all switch types and transitions.

Proposed method

• Replaces traditional continuous tracks with milestone-based structures that suggest track paths without physical continuity.
• Uses three cell states: blank (quiescent), track (blue milestone), and locomotive (red), with state transitions governed by local rules.
• Implements three switch types—fixed, flip-flop, and memory—using milestone configurations that allow directional switching and state persistence.
• Leverages the dodecagrid tiling of hyperbolic 3D space to embed circuits with 3D bridges that replace planar crossings.
• Designs a rotation-invariant rule set by ensuring that state transitions are consistent across all 12 faces of each cell in the dodecagrid.
• Employs a custom simulation program that models cell neighborhoods, tracks state evolution, and validates all locomotive passages through switches.

Experimental results

Research questions

• RQ1 Can weak universality in hyperbolic 3D cellular automata be achieved with only three states?
• RQ2 How can track representation be redefined to eliminate the need for continuous track structures while preserving computational functionality?
• RQ3 Can 3D spatial embedding be used to avoid crossings in a railway model without increasing state complexity?
• RQ4 To what extent does the third dimension enable more efficient and robust implementation of universal computation in hyperbolic automata?
• RQ5 Is a 3-state automaton in the dodecagrid truly three-dimensional, or can it be projected into lower dimensions?

Key findings

• The paper constructs a weakly universal cellular automaton in the hyperbolic 3D dodecagrid using only three states, significantly reducing the state count from previous results.
• The automaton is rotationally invariant, with rules that apply uniformly across all 12 faces of each cell in the dodecagrid.
• The use of milestones instead of continuous tracks allows for non-continuous, yet functional, track representation that supports locomotive movement and switch operations.
• The simulation program successfully verified all active and passive crossings of memory, flip-flop, and fixed switches, confirming correctness and rule consistency.
• The third dimension is essential to the design: crossings are replaced by bridges, and the structure cannot be reduced to a 2D projection without breaking functionality.
• The implementation is more efficient than prior rule 110-based constructions in terms of programming effort and execution cost, despite similar universality claims.