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 …

#Trump is butthurd by a bishop telling him indirectly that his politiks are bad.
He wants a apology and says that she is a leftextreme trump hater.
Does this sound like kindergarden drama? Yes.
Is this person running the country? Yes.
#trump

4/
And we're clear.
Significant police presence, still tailing the group. Confusing addition of CSST (crime scene techs).
A couple hundred people participated and were most definitely heard.
#FreePalestine #EndTheSiege #GenocideIsNotDefence
#PoliceDontKeepUsSafe #DefundDisarmDismantle #FuckThePolice