• 0 Posts
  • 20 Comments
Joined 1 year ago
cake
Cake day: January 6th, 2024

help-circle



  • Kayana@ttrpg.networktoScience Memes@mander.xyzmoms rule
    link
    fedilink
    English
    arrow-up
    1
    ·
    8 days ago

    Huh, really? I thought there were slightly more women than men, but maybe that depends on the economies etc.

    As for your second point, yes, exactly. They don’t reproduce. So it doesn’t matter if many men get one wife each, or if a few men get many wives each, the number of pregnancies won’t change, and the number of pregnancy-related deaths won’t change either. So (again), I don’t see how polygyny helps in this situation.


  • Kayana@ttrpg.networktoScience Memes@mander.xyzmoms rule
    link
    fedilink
    English
    arrow-up
    2
    ·
    edit-2
    9 days ago

    Edit: This first point was wrong, but the second point still stands.

    Polygyny wouldn’t solve the aforementioned problem if we suppose that the birth rate of men and women is roughly the same. If one man has many wives, some of whom even die, then several other men won’t have any wives.










  • Kayana@ttrpg.networktoich_iel@feddit.deich_iel
    link
    fedilink
    Deutsch
    arrow-up
    5
    ·
    edit-2
    8 months ago

    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.


  • 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.