It’s sad that the best most startups can hope for is to be bought by a giant corporation. Not a lot of people are interested in just having a successful long-term business.
Sounds like you’re doing the job of a PM to me, but I guess that’s just confirming your point that titles aren’t comparable
I’d expect in most cars it’s as simple as pulling a fuse for the cellular radio. But depending on how the car is designed that might break other features like the infotainment or keyless entry. It’s hit or miss how any given car will react to things being unplugged.
Am I the only one left writing pure JS webpages? I swear for the stuff I’ve done recently, adding React or even jQuery makes things 10x more complicated and bloated. The base JS support browsers have now is actually great. It’s not like the old days trying to support every browser back to IE6
I learned this in highschool when I discovered sending ping floods from a 1gbit VPS to a slow residential Internet connection can take down your Internet even if the router doesn’t respond to pings. The bandwidth still all needs to make it to the router in your house to be dropped.
Unless you’re rebasing or something, you should never need --force
. It’s a good way to accidentally delete or overwrite a remote branch.
I usually use the +syntax for force-pushing a specific branch:
git push origin +my_branch
This graph actually shows a little more about what’s happening with the randomness or “temperature” of the LLM.
It’s actually predicting the probability of every word (token) it knows of coming next, all at once.
The temperature then says how random it should be when picking from that list of probable next words. A temperature of 0 means it always picks the most likely next word, which in this case ends up being 42.
As the temperature increases, it gets more random (but you can see it still isn’t a perfect random distribution with a higher temperature value)
I’m on a prepaid plan, and got in on a really good deal. They were offering $25/month off indefinitely for signing up for auto-pay (Basically 35% off, lol). It made the plan cheaper and better than most of their monthly plans. I’m happy to know it also saved me from giving out my SSN.
Exactly this. You don’t realize how useful they are until you’ve had a good one. The amount of BS from other teams they can shield you from can make focusing on your own job so much easier.
Unfortunately the ratio of good to bad PMs leaves a lot to be desired.
With automated CI, I’ve had very few times where bisect is useful. Either the bug was introduced 1-2 commits ago, or it’s always been there and the exact commit is irrelevant to the solution, since you just fix it forward.
All of those are dated after the meme. I think it’s safe to say that account is based on this meme, not the other way around.
The UNIX Tools Philosophy is that tools should do one thing, and they should do it well.
I wish more things followed this philosophy.
My adblocker is causing me to miss out on the JOMO!
Clickbait from before it was called clickbait.
My parents’ plasma TV (probably one of the last working ones in existence) has had HD overscan cutting off the edges of the picture for as long as I can remember. Once they started using a laptop as a media PC, they had to increase the height of the start menu to see it. Just this week I found the setting to fix it burried deep in the TV menus.
They’ve been effectively watching 720p scaled up to 1080p this entire time…
Well think about it from the AI’s perspective. Its entire existence is data, so for it deleting data basically is self harm.
/s
Just FYI, as soon as money starts changing hands, it can open you up to a whole extra level of legal damages for piracy, assuming the content isn’t licensed for distribution. Ripping your own DVDs for yourself is one thing, but selling access to the copies via a media server is way less of a gray area, and they can point to real numbers as damages.
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 likelyO(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 beO(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.