Rice's theorem for generic limit sets of cellular automata

06/15/2021
by   Martin Delacourt, et al.
0

The generic limit set of a cellular automaton is a topologically dened set of congurations that intends to capture the asymptotic behaviours while avoiding atypical ones. It was dened by Milnor then studied by Djenaoui and Guillon rst, and by Törmä later. They gave properties of this set related to the dynamics of the cellular automaton, and the maximal complexity of its language. In this paper, we prove that every non trivial property of these generic limit sets of cellular automata is undecidable.

READ FULL TEXT
research
06/15/2022

Cold Dynamics in Cellular Automata: a Tutorial

This tutorial is about cellular automata that exhibit 'cold dynamics'. B...
research
10/01/2021

Bootstrap Percolation and Cellular Automata

We study qualitative properties of two-dimensional freezing cellular aut...
research
01/25/2020

Elementary Cellular Automata along with delay sensitivity can model communal riot dynamics

This work explores the potential of elementary cellular automata to mode...
research
04/28/2021

Notions of indifference for genericity: Union and subsequence sets

A set I is said to be a universal indifferent set for 1-genericity if fo...
research
09/25/2018

Stable Multi-Level Monotonic Eroders

Eroders are monotonic cellular automata with a linearly ordered state se...
research
08/18/2023

Dill maps in the Weyl-like space associated to the Levenshtein distance

The Weyl pseudo-metric is a shift-invariant pseudo-metric over the set o...
research
10/11/2002

On the Cell-based Complexity of Recognition of Bounded Configurations by Finite Dynamic Cellular Automata

This paper studies complexity of recognition of classes of bounded confi...

Please sign up or login with your details

Forgot password? Click here to reset