Small universal Turing machines
Theoretical Computer Science - Special issue on universal machines and computations
Frontier between decidability and undecidability: a survey
Theoretical Computer Science - Special issue on universal machines and computations
A new kind of science
A universal cellular automaton in the hyperbolic plane
Theoretical Computer Science
Tools for devising cellular automata in the hyperbolic 3D space
Fundamenta Informaticae - Special issue on cellular automata
Computation: finite and infinite machines
Computation: finite and infinite machines
A Universal Cellular Automaton on the Ternary Heptagrid
Electronic Notes in Theoretical Computer Science (ENTCS)
Surprising Areas in the Quest for Small Universal Devices
Electronic Notes in Theoretical Computer Science (ENTCS)
Four Small Universal Turing Machines
Fundamenta Informaticae - Machines, Computations and Universality, Part I
Towards the frontier between decidability and undecidability for hyperbolic cellular automata
RP'10 Proceedings of the 4th international conference on Reachability problems
A universal cellular automaton on the heptagrid of the hyperbolic plane with four states
Theoretical Computer Science
An algorithmic approach to tilings of hyperbolic spaces: 10 years later
CMC'10 Proceedings of the 11th international conference on Membrane computing
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 remind results on universality for cellular automata in hyperbolic spaces, mainly results about weak universality, and we deal with the halting problem in the same settings. This latter problem is very close to that of strong universality. The paper focuses on the halting problem and it can be seen as a preliminary approach to strong universality about cellular automata in hyperbolic spaces.