At #d3a we just started our session "Networks, data, society and AI" 🥳: https://d3aconference.dk/networks-data-society-and-ai/
Find us in Sal D!
@… Very cool!
I agree. This isn’t the 1980s any more, and we’re past the point that one person can build an operating system. And this is a large chunk of an operating system.
This is why I’m not even trying. But if people were willing to try with me, and I trusted them, I might change my mind.
(Unrelated: I am working on another pair of “…
Finally, the soundtrack of the #Paris2024 Opening Ceremony is published. This was certainly the highlight of the ceremony for me, Victor Le Masne did an amazing work.
https://open.spot…
Hi, I am an economist working at #ZBW, the world's largest library for economics and management. I am mostly on Bluesky, but I am also here now @…
Classic (2003) #Hackathon
- Fix the stack overflows 🍳
- Add more www to your OS 🔨
- Patch in some groundwork 🚧
- Watch Matrix: Reloaded 😎
- Have BBQ 🔥 Call it a day 🌙
#OpenBSD :openbsd:
Wishing the Russians and North Koreans a very merry season's defeatings!
----------------
"Fighters from the UA_REG Team unit of the Special Operations Forces of the Armed Forces of Ukraine struck almost a company of Russian army personnel, as well as their North Korean mercenaries.
A video of the combat operation was released on December 17 on the unit's channel.
In total, special forces drones destroyed 50 enemies and wounded 47."
"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 …