On undecidability of equicontinuity classification for cellular automata
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.
Origin : Publisher files allowed on an open archive
Loading...