The Besicovitch-Stability of Noisy Tilings is Undecidable
Résumé
In this exploratory paper, I will first introduce a notion of stability, more lengthily described in a previous article. In this framework, I will then exhibit an unstable aperiodic tiling. Finally, by building upon the folkloric embedding of Turing machines into Robinson tilings, we will see that the question of stability is undecidable.
| Origine | Fichiers produits par l'(les) auteur(s) |
|---|