A decidability result for the halting problem of cellular automata in the pentagrid
classification
💻 cs.FL
nlin.CG
keywords
problemautomatacellularhaltingpentagridwhenautomatoncellula
read the original abstract
In this paper, we investigate the halting problem for deterministic cellula automata in the pentagrid. We prove that the problem is decidable when the cellular automaton starts its computation from a finite configuration and when it has at most two states, one of them being a quiescent state.
This paper has not been read by Pith yet.
discussion (0)
Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.