Fixed Point and Aperiodic Tilings

From MaRDI portal
Publication:3533018

DOI10.1007/978-3-540-85780-8_22zbMATH Open1161.68033DBLPconf/dlt/DurandRS08arXiv0802.2432OpenAlexW3104027675WikidataQ57349711 ScholiaQ57349711MaRDI QIDQ3533018FDOQ3533018


Authors: Andrei Romashchenko, A. Shen, Bruno Durand Edit this on Wikidata


Publication date: 30 October 2008

Published in: Developments in Language Theory (Search for Journal in Brave)

Abstract: An aperiodic tile set was first constructed by R.Berger while proving the undecidability of the domino problem. It turned out that aperiodic tile sets appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals) We present a new construction of an aperiodic tile set that is based on Kleene's fixed-point construction instead of geometric arguments. This construction is similar to J. von Neumann self-reproducing automata; similar ideas were also used by P. Gacs in the context of error-correcting computations. The flexibility of this construction allows us to construct a "robust" aperiodic tile set that does not have periodic (or close to periodic) tilings even if we allow some (sparse enough) tiling errors. This property was not known for any of the existing aperiodic tile sets.


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




Recommendations



Cites Work


Cited In (19)





This page was built for publication: Fixed Point and Aperiodic Tilings

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3533018)