• 0 Posts
  • 51 Comments
Joined 1 year ago
cake
Cake day: June 21st, 2023

help-circle










  • I’ve been really enjoying it, even in its limited state. Jetpacks are a total game changer, and I love that the fuel lasts a long time. There’s still a few obvious QoL additions needed, especially with stuff like the cargo ships (gotta type the name in?!), but otherwise it’s got a really strong foundation. Also, elevators are amazing; just realized last night that one cam connect wire to the cab. Really excited to see how the game develops in the future (traaaaaains).


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




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



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