On undecidability of equicontinuity classification for cellular automata
Résumé
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.
| Origine | Fichiers éditeurs autorisés sur une archive ouverte |
|---|---|
| Licence |
Loading...