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!
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
Good ol" BobbyB does not miss, thank the gods. Memes aside, his work is indeed phenomenal.
In the Adam singularity, naturally!
Was this from the Night of the Comet movie?
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.
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
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.
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
That prick Richard Woolsey had a great character arc though!
I usually play clerics (busted good), but for my current campaign I’m playing a human fighter, and it’s a ton of fun. “What’s your character do?” “Charges into the fray, naturally”
Rather fun to play a character that’s a foil for my typically conservative & trepidatious teammates.
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.