"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 …
You know the North Koreans are getting owned when I can share a new, 4 minute long video of them getting owned and owned and owned by a plethora of drone strikes, AND share an article about how they are getting owned and owned and owned by cluster munitions, to what appears to be an even greater degree.
Mastering Rust's Error Handling: A Guide to Writing Reliable Code
Rust's error handling system is a cornerstone of the language's commitment to writing safe and reliable code. As a Rust developer, I've come to appreciate the power and flexibility it offers. The system is designed to make error cases explicit, ensuring that developers consider and handle potential failure scenarios. […]
🦀
«Split Effects with no Content Duplication»
– from @…
✏️ https://frontendmasters.com/blog/split-effects-with-no-co…