Probably some programming, some Satisfactory, etc.

Although apparently it’s a lot harder to double communio now with the new addition to the rotation? Should be interesting to see how things settle out now for max dps.

I think I’ll be leveling scholar this go-around. Although not looking forward to healer solo duties. 121111111, etc.

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.

[Still] too soon.

Oh fuck, more TTP2? God yes, bring it on! I will gleefully devour anything this series produces.

BeneG is nothing but a national treasure. I still find myself laughing at the Lopporit Zenos clip from time to time.

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

What an adorable MoonMoon!

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).

That can’t be the same Jeff Grubb as from Giant Bomb, right? I can’t imagine the ages matching up.

I don’t play Trackmania at all, but it’s been really fun to watch the daily edits that Wirtual’s YouTube has been making for the live streams. Watching someone’s heart rate shoot up ~40 bpm just after making a butt clenching jump is vicariously entertaining in the max. His video on Deep Dip 1 was also fantastic.

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

While the orb weavers and Argiope spiders are certainly a shock, it’s really the Brown Huntsman spiders (American version of the classic Clock Spider) that can instill that fight or flight response when they run at’chya. I love spiders to death and always enjoy saving them from my house, but the first time I saw one of those guys in my apartment, my legs absolutely turned to jello.

Dinosaur birds, eh? Maybe Sandhill Cranes – those things are awesome and so cool in person.

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.

There was an episode of PBS Space Time on the holographic principle in general recently, and I believe they’ve also discussed the black hole thing as well.