Séminaires à venir

Subshifts are sets of colourings of the plane. Nowadays, a bunch of relations between subshifts are usual: equality, inclusion, being "dynamically equivalent" (i.e. being conjugate), etc. Their complexity are well known (usually undecidable), but in this talk we will study complexities of the parametrized versions of these problems. For instance, for a fixed subshift X, what is the complexity of the problem to know whether a subshift Y is equal to X? Knowing the complexity of these problems enables to better understand the deep reasons of the undecidability of the general one.