The computational complexity of freezing, bounded-change, and convergent cellular automata depends on dimension and problem, with new decidability and computability separations.
In: AUTOMATA 2018
1 Pith paper cite this work, alongside 13 external citations. Polarity classification is still indexing.
1
Pith paper citing it
13
external citations · OpenAlex
fields
cs.DM 1years
2019 1verdicts
ACCEPT 1representative citing papers
citing papers explorer
-
Freezing, Bounded-Change and Convergent Cellular Automata
The computational complexity of freezing, bounded-change, and convergent cellular automata depends on dimension and problem, with new decidability and computability separations.