"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 …
Is "decentralizedwashing" a term yet? See recent #bluesky discussions like: https://social.wildeboer.net/@jwildeboer/113487613965056474
>If this is the way to superintelligence, it remai https://lemmy.dbzer0.com/post/32982890
Join us for an exciting episode of Tech Odyssey where we dive into stock market mastery using AI &proven strategies!
✅ Master Stocks Using AI & Proven Strategies w/ Ryan Metcalf - 9 Dec, 2024 | 9:00AM-9:40AM PST
https://developer.microsoft.com/en-us/reacto…