On undecidability of equicontinuity classification for cellular automata
Bruno Durand, Enrico Formenti, Georges Varouchas
Abstract
Equicontinuity classification is a popular classification of cellular automata based on their dynamical behavior. In this paper we prove that most of its classes are undecidable.
Full Text: GZIP Compressed PostScript PostScript PDF original HTML abstract page