Arithmetical hierarchy of the Besicovitch-stability of noisy tilings

DOI10.1007/s00224-023-10142-yarXiv2209.01949OpenAlexW4320177769MaRDI QIDQ6185608

Mathieu Sablik, Léo Gayral

Publication date: 8 January 2024

Published in: Theory of Computing Systems (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2209.01949

zbMATH Keywords

stabilityundecidabilitysubshift of finite typearithmetical hierarchyBesicovitch distanceRobinson tiling

Mathematics Subject Classification ID

Stability of topological dynamical systems (37B25) Symbolic dynamics (37B10) Tiling dynamics (37B52) Multidimensional shifts of finite type (37B51)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Simulation of effective subshifts by two-dimensional subshifts of finite type
• Fixed-point tile sets and their applications
• Hardness of conjugacy, embedding and factorization of multidimensional subshifts
• Dynamics and abstract computability: computing invariant measures
• Growth-type invariants for \(\mathbb Z^{d}\) subshifts of finite type and arithmetical classes of real numbers
• A characterization of the entropies of multidimensional shifts of finite type
• On the dynamics and recursive properties of multidimensional symbolic systems
• Ergodic theorems. With a supplement by Antoine Brunel
• A small aperiodic set of Wang tiles
• Seas of squares with sizes from a \(\Pi_{1}^{0}\) set
• Undecidability and nonperiodicity for tilings of the plane
• Computability on measurable functions
• Characterization of sets of limit measures of a cellular automaton iterated on a random configuration
• The Undecidability of the Domino Problem
• A generalization of the simulation theorem for semidirect products
• Characterizations of periods of multi-dimensional shifts
• 0-1-sequences of Toeplitz type
• The undecidability of the domino problem
• Automata, Languages and Programming
• Reliable cellular automata with self-organization
• On the Besicovitch-stability of noisy random tilings