Tootfinder

"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 …

#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…

Blakes7Bot | Search
Companion site to the Blakes7Bot Twitter, Mastodon, and Bluesky accounts. Automated lines of Blakes 7 dialog. Includes a script search facility.

Ce jeudi 7 novembre 2024 au Falamix Š #Renens 📌
Merci de partager !
#intergen #informatique #clicensemble #Vaud