The topological entropy of cellular automata is general not computable. We identify and characterize a subclass of one-sided cellular automata for which it is and we show that the membership in this class is undecidable.
Pietro Di Lena (2007). On Computing the Topological Entropy of one-sided Cellular Automata. JOURNAL OF CELLULAR AUTOMATA, 2(2), 121-130.
On Computing the Topological Entropy of one-sided Cellular Automata
DI LENA, PIETRO
2007
Abstract
The topological entropy of cellular automata is general not computable. We identify and characterize a subclass of one-sided cellular automata for which it is and we show that the membership in this class is undecidable.File in questo prodotto:
Eventuali allegati, non sono esposti
I documenti in IRIS sono protetti da copyright e tutti i diritti sono riservati, salvo diversa indicazione.
