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 …

I switched from Windows to Linux for personal home use a few years ago. Here's a hot tip. After running OpenSUSE Tumbleweed for a while, I moved to OpenSUSE Leap and love it. Everything works just the same, but updates are significantly faster.
#OpenSUSE #Linux

In 2017, Netflix got rid of its "5 star" rating system in favor of a simple thumbs up and thumbs down approach.
This decision fundamentally transformed their business. 🧵