Undecidable properties on the dynamics of reversible one-dimensional cellular automata
Résumé
Many properties of the dynamics of one-dimensional cellular automata are known to be undecidable. However, the undecidability proofs often rely on the undecidability of the nilpotency problem, and hence cannot be applied in the case the automaton is reversible. In this talk we review some recent approaches to prove dynamical properties of reversible 1D CA undecidable. Properties considered include equicontinuity (=periodicity), sensitivity, variants of mortality, one-sided expansivity and regularity. All these properties are undecidable, according to recent proofs obtained in collaboration with N.Ollinger or V.Lukkarila.
Domaines
Autre [cs.OH]
Origine : Accord explicite pour ce dépôt
Loading...