Two German states are about to attempt introducing a law at the federal level banning all knives with blades longer then 6cm (~~1.5~2.3 in) from beeing carried in publicin public.
Source in german: https://www.swr.de/swraktuell/rheinland-pfalz/messer-verbot-gesetz-bundesrat-rlp-100.html
This one was not passed yet.
The vote was pulled in the last minute, because they didn’t expect to get the required qualified majority. This was among other things due to the German governmant announcing to vote against it.
Germany is about to have an election next year though and the conservative and faschist parties are expected to win, I doubt they would be holding this position. France is also having an election soon with the faschists expected to win big. And their current government is responsible for this law not beeing even worse.
TLDR: It didn’t pass yet, but this will not be the last attempt at passing it.
I do recall a giant “Werbung” screen ahead of all a-blocs on TV.
highly scalled person
You might be on to something, it might have been the lizzard people!
Well I ain’t just gonna repeat it…
Nah, TCP is still just kicking the box over, but just kicking it over again, if the reciever doesn’t kick back a box saying they got it.
How is that legal?
Try (100,100,100,100,100,101) or 50 ones and a two, should result in 102 and 4 as a max respectively. I tried using less numbers, but the less numbers you use, the higher the values (to be exact less off a deviation(%-difference) between the values, resulting in higher numbers) have to be and wolframAlpha does not like 10^100 values so I stopped trying.
thanks for looking it up:).
I do think the upper bound on that page is wrong thought. Incedentally in the article itself only the lower bound is prooven, but in its sources this paper prooves what I did in my comment before as well:
for the upper bound it has max +log(n) . (Section 2, eq 4) This lets us construct an example (see reply to your other comment) to disproove the notion about beeing able to calculate the max for many integers.
to be fair it does seem to work for any two numbers where one is >1. As lim x,y–> inf ln(ex+ey) <= lim x,y --> inf ln(2 e^(max(x,y))) = max(x,y) + ln(2).
I think is cool because works for any number of variables
using the same proof as before we can see that: lim,x_i -->inf ln(sum_i/in I} e^(x_i)) <= ln(.
So it would only work for at most [base of your log, so e<3 for ln] variables.
so 0.3 ~= 1-ln(2)=max(1-ln(2),1-ln(2)) = floor(ln(2*e^(1-ln(2)))) = floor(ln(2)+(1-ln(2))) = 1 ?
That would bee engeneer 2, not Mathematician3 xD.
Just out of curiostity, what was you Idea behind that?
are there no dc-dc PSUs (or technically just voltage regulators I guess) to relace a PSU with available? That way OP could avoid part of the Ac->Dc->Ac->Dc-conversion related losses he would have with a battery-backup.
for real, my homeserver in my appartment had an uptime of 450ish days before I had to power it down, because I wanted to plug in a power meter in front of it (don’t have anything fancy with redundant psus or something like that…).
KeepassXC supports 2fa natively and in Keepass2 there is an addon available. I have a .kdbx I sync with nextcloud to my pcs and access it via WebDav on Keepass2Android. It works great (when nextcloud sync works, recently had an issue with "invalid modification date"s on my pc).
they will have to generate proof-of-work (a bunch of math that will takes time to compute) and submit it to mCaptcha.
The user doesn’t have to do anything, your computer has to do the work
peer Tube? (its not just hosted by the uploader, but close enough?)
Seems like enough did: https://netzpolitik.org/2024/etappensieg-belgien-scheitert-mit-abstimmung-zur-chatkontrolle/