"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 …
"The German newspaper #Bild also used a screenshot from the video with the caption: "The hunt for Jews has broken out again: Arab mob chases soccer fans in #Amsterdam."
#DW Fact check: False