Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings - Archive ouverte HAL Accéder directement au contenu
Article Dans Une Revue Theory of Computing Systems Année : 2023

Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings

Résumé

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 unstable aperiodic tiling, and then see how it can serve as a building block to implement several reductions from classical undecidable problems on Turing machines. It will follow that the question of stability of subshifts of finite type is undecidable, and the strongest lower bound we obtain in the arithmetical hierarchy is $\Pi_2$-hardness. Lastly, we prove that this decision problem, which requires to quantify over an uncountable set of probability measures, has a $\Pi_4$ upper bound.

Dates et versions

hal-03771115 , version 1 (07-09-2022)

Identifiants

Citer

Léo Gayral, Mathieu Sablik. Arithmetical Hierarchy of the Besicovitch-Stability of Noisy Tilings. Theory of Computing Systems, 2023, ⟨10.1007/s00224-023-10142-y⟩. ⟨hal-03771115⟩
19 Consultations
0 Téléchargements

Altmetric

Partager

Gmail Facebook X LinkedIn More