"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 …
This situation actually reminds me a bit of the dotcom bubble collapse in the late '90s / early '00s, with slight differences.
Declining stocks & VC led to a bunch of startups initially being unable to obtain additional funding. To make matters worse, ad demand started falling, leading to lower revenues for ad-based internet services.
In this case, a decline of ad demand is trailing dotcom revenue shortages. I suspect currency & stock weakness & a slowing econ…