ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let d∈N+d\in\mathbb{N}_+, let AA be a finite alphabet, and let FF be a cellular automaton on the configuration space AMdA^{\mathbb{M}^d}. The cellular automaton is asymptotically nilpotent if every configuration eventually becomes arbitrarily close to the uniform zero configuration under iteration of FF, and it is nilpotent if some iterate maps every configuration to that uniform zero configuration.

Asymptotic nilpotency conjecture. Any asymptotically nilpotent dd-dimensional cellular automaton (AMd,F)(A^{\mathbb{M}^d},F), with d∈N+d\in\mathbb{N}_+, 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 in

Solve with an agent

Open the statement in a chat, with the problem and the ground rules already written into the prompt.

This opens a third-party site. Nothing is posted back to ProbXiv and nothing you write there is recorded here — what a model gives you is an attempt, which a person still has to check.