"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 …
There's 3 types of people in this world:
1️⃣ Baffled folks with closed mindsets, completely clueless & scared of AI
2️⃣ Loud, untrained self-proclaimed experts who complain about AI more than they learn about it
3️⃣ Educated #AI users quietly & rapidly getting things done w/ a wry smile
OK, that was a lot of soldering #diysynth
Well doesn't this look interesting: #MPSGöttingen's renowned dynamo experts Manfred Schüssler and Robert Cameron together with Paul Charbonneau, Masumi Dikpati, Hideyuki Hotta, Leonid Kitchatinov have edited the new Space Sciences series of ISSI #book
"Solar and Stellar Dy…