"Tiling with Three Polygons is Undecidable"
Erik D. Demaine; Stefan Langerman 17 Sep 2024
Abstract
We prove that the following problem is co-RE-complete and thus undecidable: given three simple polygons, is there a tiling of the plane where every tile is an isometry of one of the three polygons (either allowing or forbidding reflections)? This result improves on the best previous construction which requires five polygons.
...
It remains open whether tiling …
Ilmus Vikerkaare humanisminumber. Ma ise tõlkisin sinna Marsilio Ficino kirju, mis on üllatavalt tänapäevaselt kõlavad, oli väga lõbus, vahelduseks. Ma tean, et teised asjad, mis seal on, on ka head. Pico della Mirandola kõne on igaljuhul miski, mida peaks lugema igaüks, kes renessanssi perioodi mõtlemisest tahab aimu saada.
https://www.