I know you’re making a joke, but this doesn’t really feel like the place to do it given the subject being discussed.

Do you want your drunk antics livestreamed and recorded for the entire world to see forever, instead of just the few people in the bar paying attention?

I think what we actually need is someone to take a picture of their screen with a microscope while the image is zoomed out.

Based on some comments I’ve seen, it seems likely this is just an artifact of how the red/green/blue pixel layouts work when drawing the edges of white things.

Edit: I don’t have something to check the actual display pixels, but I realized I could just rotate the image and see if the colors change, which they don’t. So this definitely seems like more of a white balance effect, similar to that old Gold/Blue Dress meme.

Based on a world population of 8 billion, that would be roughly 0.000000000000008% of a person. It’s also not even representable as a 64 bit float so I had to do this math in my head (Calculator just says 0)

A phone call? Like… the original use of a phone?

I’ve been using an ad blocker for at least 15 years. I’m not about to stop now. I can’t imagine paying only to see less relevant ads…

Dang, I kind of want one of those glass dragons. That sounds awesome

That’s kinda fucked up. Almost sounds like laws targeting homeless people living out of their cars. And for anyone else, why shouldn’t I be able to just tour around and look at sights without necessarily stopping anywhere? That’s basically what I do every weekend for fun.

Interesting that strtol in C does that. I’ve always explicitly passed in base 10 or 16, but I didn’t know it would auto-detect if you passed 0. TIL.

Yep. Ubiquiti sells wifi 7 APs and the latest phones support it as of some time last year I think. The big new feature is 6GHz and the ability to automatically hop between frequencies (You can use 6, 5 and 2.4GHz all at once). Latency has been great, and I easily get 1Gbps+ in the same room as my wifi.

Well, you’re right. I wasn’t getting it, but I’ve also never seen any piece of software that would treat a single leading zero as octal. That’s just a recipe for disaster, and it should use 0o116 to be unambiguous

(I am a software engineer, but was assuming you meant it was hardcoded to parse as octal, not some weird auto-detect)

Well shit, my zip code starts with a 9.

You have a very twisted view of the world. No one was “allowed” to shoot Abe Lincoln or JFK. It was very much not allowed, but murderers don’t usually care about what’s allowed and do it anyway.

Damn, I didn’t even see that until you pointed it out. I would have died.

Hahaha, that hardware is built to be as cheap as possible so they can make money on this scam of a product. I doubt the people making it even know what a TPM is from everything else we’ve seen.

I’m not sure that’s even a valid comparison? I’d love to know where you got that data point.

LLMs run until they decide to output an end-of-text token. So the amount of power used will vary massively depending on the prompt.

Search results on the other hand run nearly instantaneously, and can cache huge amounts of data between requests, unlike LLMs where they need to run every request individually.

I’d estimate responding to a typical ChatGPT query uses at least 100x the power of a single Google search, based on my knowledge of databases and running LLMs at home.

No, there’s definitely a science to this. It’s the same reason sandwiches taste better if you cut them in a triangle. The sharp points make for the perfect bite size.

A quadratic function is just one possible polynomial. They’re also not really related to big-O complexity, where you mostly just care about what the highest exponent is: O(n^2) vs O(n^3).

For most short programs it’s fairly easy to determine the complexity. Just count how many nested loops you have. If there’s no loops, it’s probably O(1) unless you’re calling other functions that hide the complexity.

If there’s one loop that runs N times, it’s O(n), and if you have a nested loop, it’s likely O(n^2).

You throw out any constant-time portion, so your function’s actual runtime might be the polynomial: 5n^3 + 2n^2 + 6n + 20. But the big-O notation would simply be O(n^3) in that case.

I’m simplifying a little, but that’s the overview. I think a lot of people just memorize that certain algorithms have a certain complexity, like binary search being O(log n) for example.

We’re talking about legally, not practically. Obviously copying movies is physically possible.

Damn, $1500 is actually a great price for a 4090. If only…

Edit: I don’t know how I got here. I just realized this post is 4 months old.