Yeah that's a fair point, although it's still a bit… well, funny (not "funny ha ha") that they even temporarily blocked those extensions. Not sure what Roskomnadzor could have done if Mozilla had refused even a temporary block, at least assuming the foundation doesn't have any legal entities in Russia which they may well have
Google Translate is generally hot garbage. I've actually found DeepL surprisingly good especially with more "niche" languages like Finnish, although it does definitely sometimes get things hilariously wrong
Well, yes and no. With a straight-up hash set, you're keeping set_size * bits_per_element bits plus whatever the overhead of the hash table is in memory, which might not be tenable for very large sets, but with a Bloom filter that has eg. ~1% false positive rate and an ideal k parameter (number of hash functions, see eg. the Bloom filter wiki article) you're only keeping ~10 bits per element completely regardless of element size because they don't store the elements themselves or even their full hashes – they only tell you whether some element is probably in the set or not, but you can't eg. enumerate the elements in the set. As an example of memory usage, a Bloom filter that has a false positive rate of ~1% for 500 million elements would need 571 MiB (noting that although the size of the filter doesn't grow when you insert elements, the false positive rate goes up once you go past that 500 million element count.)
Lookup and insertion time complexity for a Bloom filter is O(k) where k is the parameter I mentioned and a constant – ie. effectively O(1).
Probabilistic set membership queries are mainly useful when you're dealing with ginormous sets of elements that you can't shove into a regular in-memory hash set. A good example in the wiki article is CDN cache filtering:
Nearly three-quarters of the URLs accessed from a typical web cache are "one-hit-wonders" that are accessed by users only once and never again. It is clearly wasteful of disk resources to store one-hit-wonders in a web cache, since they will never be accessed again. To prevent caching one-hit-wonders, a Bloom filter is used to keep track of all URLs that are accessed by users. A web object is cached only when it has been accessed at least once before, i.e., the object is cached on its second request.
If you meant my user ID example, you'd prepopulate the bloom filter with existing user IDs on eg. service startup or whatever, and then update the filter every time a new user ID is added – keeping in mind that the false positive rate will grow as more are added, and that at some point you may need to create a new filter with a bigger backing bit array
That's definitely not what they're most useful for. I mean, you probably can use a bloom filter for implementing spell check, but saying that's where they're most useful severely misses the point of probabilistic set membership queries.
Bloom filters and their relatives are great when you have a huge set of values – eg. 100s of millions of user IDs in some database – and you want to have a very fast way of checking whether some value might be in that set, without having to query the database. Naturally this assumes that you've prepopulated a bloom filter with whatever values you need to be checking.
If the result of the bloom filter query is "nope", you know that the value's definitely not in the set, but if the result is "maybe" then you can go ahead and double-check by querying the database. This means that the vast majority of checks don't have to hit that slow DB at all, and even though you'll get some false positives this'll still be much much much faster than having to go through that DB every time.
Wait, 5 million people had 20 different choices, and y’all picked the nazis? How the fuck did that happen?
Too many Nazis here, and I’m not being facetious.
The best (“best”) part is that one minister essentially had to resign because he’s a Nazi, so the extremist right wing party (well, one of them…) replaced him with a pedophile Nazi. Somehow he hasn’t been forced to resign. I guess part of it is that he’s more “smart” about his Nazism and doesn’t do it as openly as the other dude, and reich-wingers say that he’s not a pedophile because he didn’t get convicted, but that’s only because cops couldn’t (or, more likely, wouldn’t) prove anything except that he had asked eg. teenagers out on dates, called them sexy etc etc but none of that is illegal.
Honestly this country is incredibly fucked up and in case anybody was planning to visit I recommend staying the fuck away, there’s better vacation spots with fewer Nazis.
But yeah, I don’t think any system of government will work. Humans are just way too shitty on average
We’re fairly conservative compared to the rest of the Nordics, so it’s probably just a case of Finns being complete fucking imbeciles as per usual. It’s even been a running joke here that Russia doesn’t have to do anything to us, we’re perfectly capable of fucking up the country ourselves.
And it’s not likely to get any better either. The under-25’s are more conservative than millennials or even Gen X