@nprofile1q... For what it's worth, I bought the bundle and liked your stories very much. If I had to pick a favourite, it would be either the mad scientist with his dead wife (no spoilers!) or the man who returns to his less-than-loveable family as a boy. They're both very good.

@nprofile1q... Von der Leyen tried similar things when she was the German interior minister, earning her the nickname "Zensursula" (roughly "censoring Ursula")

@nprofile1q... something to keep in mind, though it does not fully answer your question: There is (apparently, can't find the reference right now) some legal precedent in the US that copyright does not apply to AI-generated works.

@nprofile1q... Shameless plug alert: see also https://eprint.iacr.org/2025/1237, by Peter and yours truly.

@nprofile1q... Können wir den ersten Satz mal einrahmen?

@nprofile1q... Als ob die Probleme bei der Digitalisierung bei zuwenig KI und zuviel Datenschutz zu suchen wären.

@nprofile1q... Kommt drauf an. Die schreiben: "Human Hantavirus infection is primarily acquired through contact with the urine, faeces, or saliva of infected rodents or by touching contaminated surfaces. Exposure typically occurs during activities such as cleaning buildings with rodent infestations" und dass Übertragung von Mensch zu Mensch selten ist. Da macht Handhygiene schon mehr Sinn, als eine Maske, oder? Es sei denn, die wittern wieder eine Tröpfcheninfektion, wo keine ist.

@nprofile1q... Als ich gelesen hatte, dass Frau von der Leyen selbstzerstörende Nachrichten verwendet, wurde mir plötzlich klar, wieso Signal unter Politikern so beliebt ist.

@nprofile1q... These proposals are broken so quickly that it would be a good idea IMO to put the brakes on any attempt at standardising them. But if one absolutely must standardise, then at least standardise hybrids, for crying out loud.

@nprofile1q... The article claims that factorisation takes exponential time, I.e., is proportional to e^(an) where a is a constant and n is the number of bits in the number to be factored. But that's not true: the best factoring algorithm known to date, the General Number Field Sieve, takes subexponential time. This class of functions grows faster than any polynomial, but slower than any exponential. One example of a subexponenrial function is e^(√n).

@nprofile1q... Additionally, factorisation is not exponential, but subexponential.

@nprofile1q... Aaah, nice! Danke :-)