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 …

About those massive Russian losses of equipment near Kursk... looks like Ukraine released video of it.
Considering that Russia only has about 5-2 odds on that front, well... I don't think things are going all that well. Whatever gains they are making are just too expensive.

Have you remediated a PDF file with Acrobat? Have you ever accidentally clicked "Autotag document" and wiped out your manual tagging?
If so, please consider voting to remove this action from the context menu.
#Acrobat #PDF

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. […]
🦀

Mastering Rust's Error Handling: A Guide to Writing Reliable Code
Discover Rust's powerful error handling system. Learn to write safer, more reliable code with Result, panic!, and custom error types. Improve your Rust skills today.

Okay I just discovered Technology Connections is on fedi (@…) and I’m literally so fucking happy now, why didn’t I check their YouTube about section earlier