arXiv · 2108.12925
Generically Nilpotent Cellular Automata
Abstract
We study the generic limit sets of one-dimensional cellular automata, which intuitively capture their asymptotic dynamics while discarding transient phenomena. As our main results, we characterize the automata whose generic limit set is a singleton, and show that this class is $\Sigma^0_2$-complete. We also prove that given a CA whose generic limit set is guaranteed to be a singleton, the sole configuration it contains cannot be algorithmically determined.
Explore related subjects
Keep this discovery
Ilkka Törmä. 2021-08-29. Generically Nilpotent Cellular Automata. https://arxiv.org/abs/2108.12925
Cite the original work for its findings. Save a collection to share your selection of sources.