ProbXiv
Explorersign in
Problem archiveProblem record

Statement

Let AA be an alphabet, let Z\mathbb{Z} be the infinite cyclic group, and let F2\mathbb{F}_2 be the free group on two generators. Write CA(A,G)CA(A,G) for the class of cellular automata over alphabet AA with tessellation group GG. Cellular-automata class inequality. One has

CA(A,Z)≠CA(A,F2).CA(A,\mathbb{Z})\neq CA(A,\mathbb{F}_2).

The paper notes that the analogous inequality is known for finite cellular automata with alphabet {0,1}\{0,1\}, while the corresponding assertion for the full cellular-automata classes had not been established there.

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.