Starsector is amazing, even though buying it on the website made me wonder if the storefront was made in the 90s.

projects/[rust|cpp|python|..]/proj-name

Exactly same. Gf & I got into it a few weeks ago and just caught up to current. We’re champing at the bit to see what happens next.

Jade #1!

A Queer Homodynamics chart? Dope!

It is - without the quiet zone, it makes detecting the locator pattern really difficult, especially in one’s looking for the 1:1:3:1:1 ratio.

Used to write software for reading QR Codes, and it was a fascinating process, dealing with increasingly bad customer images. They’re pretty resilient though!

For any not in the loop: https://en.wikipedia.org/wiki/Grigori_Perelman

Naturally, he thought it was a Graham Cracker.

Good ol" BobbyB does not miss, thank the gods. Memes aside, his work is indeed phenomenal.

In the Adam singularity, naturally!

Man, Chuck Schuldiner’s early work sounded a lot different from the later years! (/s)

Aye. Granted, I’m on Dynamis so my experience is going to be wildly different from, eg. Aether, but I’ve only had one occasion of long queues, and that was when Aether died. And even then, it was steady progress, unlike the Login Roulette of Endwalker.

I’ve been playing Heart of the Machine, and really enjoying it. It’s a fascinating 4x ish in a future city, in a bit of an inversion of AI Wars (same developer). Before playing, I was merely intrigued, but now I’m excitedly awaiting where it goes. It was, however, initially difficult to figure out what to do. Perhaps more UX is going to be useful here.

This song was the absolute bomb to play on drums in Rock Band. I really loved the snare / bass drum flow with the hats.

You get a tactical nuke, you get one, you get one… tactical nukes for all!

video-sizes

I’m confused as to your meaning here. Current codecs are miles ahead of what we had in the past. Unless you mean typical resolution (eg. 4k, 8k, etc).

For the purposes of OPs problem (P v NP), it considers not particular solutions, but general algorithmic approaches. Thus, we consider things as either Hard (exponential time, by size of input), or Easy (only polynomial time, by size of input).

A number of important problems fall into this general class of Hard problems: Sudoku, Traveling Salesman, Bin Packing, etc. These all have initial setups where solving them takes exponential time.

On the other hand, as an example of an easy problem, consider sorting a list of numbers. It’s really easy to determine if a lost is sorted, and it’s always relatively fast/easy to sort the list, no matter what setup it had initially.

The Italian game just oozed style. Really fascinating imagery.

I think you may be conflating something with the story of Perelman, who solved the Poincare conjecture (with its 1 million dollar prize), rejected the prize and basically told the math world to stuff it: https://en.m.wikipedia.org/wiki/Grigori_Perelman

Coincidentally, I do work on embedded devices, but as mentioned by ferret, most embedded stuff nowadays is (I think?) an Arm variant. Most all of the device code I write is C++ though; no need to get into assembly land unless clang screws something up, but that hasn’t happened yet thankfully. That said, in the future, this may change as we optimize certain imaging algorithms further.