The purpose of this article is to study the algorithmic complexity of the Besicovitch stability of
noisy subshifts of finite type, a notion studied in a previous article. First, we exhibit an …

A subshift of finite type is a set of tilings of a group subject to a finite number of local
constraints, where the group acts by translation. In recent years, much progress has been …

We study the algorithmic undecidability of abstract dynamical properties for sofic $\mathbb
{Z}^{2} $-subshifts and subshifts of finite type (SFTs) on $\mathbb {Z}^{2} $. Within the class …

We study the seeded domino problem, the recurring domino problem and the $ k $-SAT
problem on finitely generated groups. These problems are generalization of their original …

1In Lemma 2.4, we denote NC1 for “Nick's Class” of complexity of level 1, ie the class of
languages L⊆ Σ∗ such that L is decidable by Boolean circuits with a polynomial number of …