Résumé
We study the error robustness of Wings of the plane. The fundamental question is the following: given a tileset; what happens if we allow a small probability of errors? Are the objects we obtain close to an error-free tiling of the plane?
We prove that tilesets that produce only periodic tilings are robust to errors. For this proof, we use a hierarchical construction of islands of errors (see [6,7]). We also show that another class of tilesets, those that admit countably many things is not robust and that there is no computable way to distinguish between these two classes.