"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
#Blakes7 Series D, Episode 08 - Games
TARRANT: Well not exactly. These things chuck the lot at you. Flying the real thing's nothing after one of these.
GAMBIT: Countdown eight minutes, still running.
https://blake…
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…
Series C, Episode 02 - Powerplay
DAYNA: Whh, he's just one less to deal with, do we care why? [pause] But why leave him sitting there?
AVON: To delay discovery and give the murderer a chance to get away.
https://blake.torpidity.net/m/302/286 B7B4
Ce jeudi 7 novembre 2024 au Falamix Š #Renens 📌
Merci de partager !
#intergen #informatique #clicensemble #Vaud
[Support informatique gratuit]
📌 Partage ce post avec tes amis
🚇 Viens Š Romanel ou Š renens cette semaine 🚀
#intergen #informatique #clicensemble #Vaud