Asymptotic nilpotency conjecture for cellular automata in all dimensions
Statement
Let , let be a finite alphabet, and let be a cellular automaton on the configuration space . The cellular automaton is asymptotically nilpotent if every configuration eventually becomes arbitrarily close to the uniform zero configuration under iteration of , and it is nilpotent if some iterate maps every configuration to that uniform zero configuration.
Asymptotic nilpotency conjecture. Any asymptotically nilpotent -dimensional cellular automaton , with , is nilpotent.
The statement is proved in the paper for one-dimensional cellular automata, while the analogous assertion in higher dimensions is presented as a natural but unresolved generalization; the juxtaposition argument used in the one-dimensional proof does not directly extend to higher-dimensional grids.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.