Sollen das Temperaturen sein? Erinnert mich an diesen Edelstein.
Sollen das Temperaturen sein? Erinnert mich an diesen Edelstein.
Mein Straßenverkehrsamt tendiert dazu, bei Leuten mit nur einem Namen in ihrem (bspw. indischen) Pass einfach den Namen als Vor- und Nachnamen zu nehmen, sodass bei ihnen dann <Name> <Name> auf dem Führerschein steht… Nur, weil die deutsche Bürokratie nicht mit nur einem Namen klarkommt.
Huh, interesting… You know, I’ve never really wondered about Humble Bundle specifically, but you’re right, they seem to be selling your run-of-the-mill Steam keys, or at least you can activate them effortlessly in Steam. Maybe it’s a case of Steam themselves handing out keys (instead of the publishers) to increase user retention? I honestly don’t know, this is all just speculation.
I actually didn’t click on your link at first, because I assumed it would just show other stores where you could purchase the whole game instead of a key, so I’m sorry that you had to clarify that.
As far as I know, they do - for Steam keys. If you’re selling your game through other stores, not just a Steam key, there aren’t any demands placed upon you. The OC might’ve been talking about that.
Can you even kill something that’s already dead?
Gotcha, I didn’t catch that on my first read-through.
This seems wrong…
10^17 milligrams
-> 10^14 grams
-> 10^11 kilograms
-> 10^8 tons
So it should actually be 553 402 322 tons, which means that we can do it only using the rice produced in 2022.
But you just completely ignored everything I said in that comment.
Mathematically, that is precisely how O notation works, only (as I’ve mentioned) we don’t use it like that to get meaningful results. Plus, when looking at time, we can actually use O notation like normal, since computers can indeed calculate something for infinity.
Still, you’re wrong saying that isn’t how it works in general, which is really easy to see if you look at the actual definition of O(g(n)).
Oh, and your computer crashing is a thing that could happen, sure, but that actually isn’t taken into account for runtime analysis, because it only happens with a certain chance. If it would happen after precisely three days every time, then you’d be correct and all algorithms would indeed have an upper bound for time too. However it doesn’t, so we can’t define that upper bound as there will always be calculations breaking it.
It’s very pedantic, but he does have a point. Similar to how you could view memory usage as O(1) regardless of the algorithm used, just because a computer doesn’t have infinite memory, so it’s always got an upper bound on that.
Only that’s not helpful at all when comparing algorithms, so we disregard that quirk and assume we’re working with infinite memory.
Wow, writing the same paragraphs three times… What an abomination of an article.
That may be true for smaller cities, but in bigger cities it becomes impossible, because there just isn’t enough space to house all the people near areas of interest. Cars don’t factor in there at all. Give me a subway for the major areas, and perhaps a tram or bus system so you don’t need that many subway stations in the residential areas, and you can have car-free city centers.
To be honest, I don’t really like it either, which might surprise you considering my last sentence. I just couldn’t resist making a small pun myself.
Got a laugh from me, but I did mean only the ‘a’, not the ‘ar’. I couldn’t think of any other English word with that sound unfortunately, do you have a better suggestion?
I don’t really like including pedestrians in there. Like sure, you can fit a bunch of people in a small area, but another point you shouldn’t ignore is the throughput over time, and pedestrians are by their nature rather slow. Obviously if you’re looking at shopping in a street lined by shops left and right, then that street becomes tailor-made for pedestrian traffic (and nothing else except perhaps bicycles). But public transport is much better suited for travelling any further distances, and that should be the main focus when deciding to ditch cars.
Try pronouncing the ‘a’ in pan like the ‘a’ in large, then you’ll end up with a rather well-done pun.
Late reply, but for me personally, I started doing it because my Keepass database is already accessed using two factors (password and key file). Therefore, I’d gain very little by keeping the second factor of those sites external - essentially, those second factors are compounded into the second factor for the database.
Funnily enough, in D&D 5E that wizard explicitly can cast that spell (if you’re equating Power Word Kill to Avada Kedavra)
I mean, it’s literally the second sentence in that article: Dragon Rider by Cornelia Funke
Wouldn’t 10d10 be something very different? Like, I can get a result of 43 with the commonly used definition of 10d10 (10 dice with 10 sides each), but I can only get multiples of 10 with the die in question.
Possible formula: Tax for n-th house = n-th Fibonacci number + 5 * max(0, n - 2). So low numbers like three get penalized by that linear part, and high numbers grow exponentially due to the Fibonacci number.