Good ol" BobbyB does not miss, thank the gods. Memes aside, his work is indeed phenomenal.
Good ol" BobbyB does not miss, thank the gods. Memes aside, his work is indeed phenomenal.
In the Adam singularity, naturally!
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.
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
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.
For any not in the loop: https://en.wikipedia.org/wiki/Grigori_Perelman