Hard Asymptotic Sets for One-Dimensional Cellular Automata
Abstract
We prove that the (language of the) asymptotic set (and the nonwandering set) of a one-dimensional cellular automaton can be 11-hard. We do not go into much detail, since the constructions are relatively standard.
0
Turn this paper into a lesson
ArcXiv compiles a structured reading guide from this paper's metadata: plain-English importance, contributions, prerequisite concepts, which sections to read first, flashcards, and a quiz. Grounded in the abstract, never invented.