• 0 Posts
  • 22 Comments
Joined 2 years ago
cake
Cake day: June 21st, 2023

help-circle
  • I was just about to mention exactly these games!

    Outer Wilds’ ending was, to me, a beautiful meditation on confronting loss, the ending of things, and coming to peace with it.

    Shadowbringers was along a similar theme. It was interesting emphasizing with Emet, and yet still realizing he’s wrong (“cool motive, still interdimensional genocide”). It was a combination of feeling unbearably sad for him, and yet thankful for stopping him. Also, seeing Ardbert during the camera pan in the Crystarium at the end.

    Endwalker’s final walk had to have been designed in a lab to generate waterworks. What an experience.






  • Back in August '22, I weighed about 270 lbs @ 6’0 (122.5 kg, 183 cm). I realized this was dangerously unhealthy so I asked my doctor if there was any drug options for helping me change habits. As my insurance didn’t cover weight loss, the doc opted for Phentermine. It drastically cut my food cravings and with exercise I’ve been losing weight steadily since. Down to 215 lbs now and the physical benefits are great: no more constant GIRD, can bend over without discomfort, etc.

    It is funny though, just finally barely breaking the obese barrier (30 bmi) and people say “and you still want to lose more weight??” My goal is 180.

    Edit: As an aside, how fucked is it that insurance companies don’t cover weight loss; wouldn’t covering it reduce their costs over time?










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




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


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