Frontier between decidability and undecidability: a survey
Theoretical Computer Science - Special issue on universal machines and computations
NP problems are tractable in the space of cellular automata in the hyperbolic plane
Theoretical Computer Science
A new kind of science
A universal cellular automaton in the hyperbolic plane
Theoretical Computer Science
A Universal Cellular Automaton on the Ternary Heptagrid
Electronic Notes in Theoretical Computer Science (ENTCS)
Small Semi-Weakly Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
A universal cellular automaton on the heptagrid of the hyperbolic plane with four states
Theoretical Computer Science
A new weakly universal cellular automaton in the 3D hyperbolic space with two states
RP'11 Proceedings of the 5th international conference on Reachability problems
Hi-index | 0.00 |
In this paper, we indicate the progression over ten years of the study of weakly universal cellular automata in the hyperbolic plane. This research obtained the ultimate limit with a weakly universal cellular automaton with two states which is rotation invariant and also actually planar, a new result.