Naturally, he thought it was a Graham Cracker.
Naturally, he thought it was a Graham Cracker.
Does Sympathy count? Technical Death Metal that absolutely slays.
Good ol" BobbyB does not miss, thank the gods. Memes aside, his work is indeed phenomenal.
In the Adam singularity, naturally!
I remember first listening to this album back in ~99, and man I couldn’t even process its greatness. Love it. I remember reading, seemingly a million years years ago, that a follow up album was still in the works, but it’s been 26 years now… I’ll huff some more copium I guess.
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.
Absolute banger classic.
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.
Oh fuck, more TTP2? God yes, bring it on! I will gleefully devour anything this series produces.
This song was the absolute bomb to play on drums in Rock Band. I really loved the snare / bass drum flow with the hats.
Are there any other death metal bands with a vocal delivery similar to Archspire?
What an adorable MoonMoon!
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.
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.
Proficient: Rust, C++, Python, x86-64 ASM, SSE1 SIMD, C#, C, Javascript / Node.JS
Can get by: Java / JNI, Kotlin, Bash
Been a while: Perl, Haskell, Prolog, Labview, Lisp
For any not in the loop: https://en.wikipedia.org/wiki/Grigori_Perelman