On Computing the Topological Entropy of One-sided Cellular Automata
Pietro Di Lena · Archivio istituzionale della ricerca (Alma Mater Studiorum Università di Bologna) · 2007
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.