And precisely because it's such a huge headache to do yourself, I think a small company could make a nice business wrapping up used datacenter cards in that sort of server.
2,270 karma · joined November 20, 2015
And precisely because it's such a huge headache to do yourself, I think a small company could make a nice business wrapping up used datacenter cards in that sort of server.
Is that just two people with different go-to examples? Or is there something going on here?
(I don't mean this as a leading question to some conclusion in my back pocket, I genuinely have no clue.)
The transition between crypto and ai on the graphs is already pretty funny. https://hackernewstrends.com/?q=crypto&q=chatgpt
(I mean, I think this looks incredibly like a bubble too, but for completeness sake, that's the counterexample I can think of.)
Absurd that we have these sorts of workarounds, but of course the view numbers are better if it keeps fishing for just the right kind of clickbait trash that you'll wolf it down endlessly.
There are a lot of barriers between kids and better solutions, one of which is that anything needs a domain and a server, and that means a credit card.
My favorite maze algorithm is a variant of the growing tree algorithm - each time you carve a cell, add it to a random one of N lists. When choosing a cell to visit, pop the last cell off the first non-empty list. It's considerably faster than the standard tree algorithm, but more importantly, changing N has a dramatic impact on the texture of the maze (compare 1 2 4 8 etc on a decently large maze).
If you want a real cursed problem for Gaussian splats though: global illumination. People have decomposed splat models into separate global and PBR colors, but I have no clue how you'd figure out where that global illumination came from, let alone recompute it for a new lighting situation.
> The kernel is still adding support for some 32-bit boards, he said, but at least ten new 64-bit boards gain support for each 32-bit one.
And
> To summarize, he said, the kernel will have to retain support for armv7 systems for at least another ten years. Boards are still being produced with these CPUs, so even ten years may be optimistic for removal. Everything else, he said, will probably fade away sooner than that.
So, no, he does not think that at all.
Letters are almost always monsters, but which monsters are in which game is anyone's guess.
Builds so messy that you need to resort to venv, every second DOM API being someFunc(thirdMostImportantArgument, { mostImportantArgument: val }), these are the real wtfs.
You don't strictly need known/consistent types, but it sure helps, since otherwise everything needs to be 8 bytes.
I don't think a way to read into and out of ArrayBuffers is possible, since these can have pointers in them. I think it needs a StructArray class instead, so there's a way to actually make a compact memory array out of all of this.
[0] http://www.catb.org/esr/jargon/html/B/bricktext.html (Also wow Google has completely erased this concept from its search results.)
The NP-complete problems are for finding the optimal number of colors, or determining if the graph can be colored using a set small number of colors.
Erin's solution aims for a small number of colors, but doesn't try to be the optimal number.
(This is second hand through a neighbor who actually went and bothered them about all the outages, so there are probably mistakes.)