https://xcancel.com/NateSilver538/status/1853673781350260902

  • kleeon [he/him, he/him]
    ·
    2 months ago

    the simulation in question:

    for (int i = 0; i < 80000; i++) {
   if (rand() % 2 == 0) {
      printf("Kamala wins\n");
   }
   else {
      printf("Trump wins\n");
   }
}
    • carpoftruth [any, any]
      ·
      2 months ago

      could you please input that into chatgpt so it will give me a summary of the code output? I'm a busy data driven guy so I don't have time for the details. however, I do have time for this post

    • SSJ3Marx
      ·
      2 months ago

      deleted by creator

    • merthyr1831@lemmy.ml
      ·
      2 months ago

      huh, the sync for Lemmy code block renderer doesn't show the \ even within the code block 👁️👁️

    • plinky [he/him]
      ·
      2 months ago

      Seems lots of unnecessary mods tbh,

      S=0

      for i in 1:80000

      S+=rand()

      end

      ceil(S)

      • naom3 [she/her]
        ·
        2 months ago

        Modding by 2 is just a bitwise operation tho

        • plinky [he/him]
          ·
          2 months ago

          Gotta dump results in some accumulate tho, and if then logic might be eh (although with branch prediction it might be auto 2 threads actually soviet-hmm or similar utilization at least)

          • DaPorkchop_@lemmy.ml
            ·
            2 months ago

            A reasonable compiler could optimize this into a bitwise AND, load the pointer to the appropriate string constant into a register branchlessly using a lookup table or cmov instruction, and then execute a single call to printf.

            • plinky [he/him]
              ·
              2 months ago

              I mean if I want to know the precise number, like 40012 or whatever. Obviously single call is fast, but printf of 40000 strings single strings is meh. I mean in my variant I don’t run comparison, even bitwise, just 80000 rand and sum, single ceil and print

    • Hexboare [they/them]
      ·
      2 months ago

      I'm guessing it literally is a few lines in R, plugging in the polling data after running it through a "model" (i.e. tinkering with the variables based on how polls have historically translated into votes)

    • FunkyStuff [he/him]
      ·
      2 months ago

      Take polling data then randomly roll for some error within the margin of error for each state. Then adjust based on bias. Do this n times and get your prediction.

      • loathsome dongeater@lemmygrad.ml
        ·
        2 months ago

        Is there a point to this? From the tweet it doesn't give new information. It just reaffirms that three contest will be close which everyone knew.

        • FunkyStuff [he/him]
          ·
          2 months ago

          They didn't get a certain answer so it was useless this time, but if it had turned out that somehow one candidate won a supermajority of simulations then you got useful information. Can't know unless you ask.

        • Eris235 [undecided]
          ·
          2 months ago

          There is utility in some cases; there's correlations between polling and areas, and the electoral college makes it all complicated (by design)

          But, like, here? No, no practical difference between any of the 'models' all showing some variation of 'its a toss up'

        • Hexboare [they/them]
          ·
          2 months ago

          Yes, it's possible that despite close in polls, the margin of error would favour one candidate being more likely to win.

          "Everyone knows" something until there's evidence to the contrary.

          The polls and outcome could still be wrong if something unexpected happens, like if all the people who don't usually vote decide this is the most important election and vote for the first and only time in their life.

    • carpoftruth [any, any]
      ·
      2 months ago

      stochastic modeling is the key word for this type of modeling if you actually care. that kind of thing is used for all kinds of stuff - weather, climate, ecology, river flows, economics

    • Hexboare [they/them]
      ·
      2 months ago

      This is more like slamming rocks together 300 times and getting sparks 150 times

  • Awoo [she/her]
    ·
    2 months ago

    "We flipped a coin 80,000 times and it landed on Heads 40,012 times"

  • axont [she/her, comrade/them]
    ·
    2 months ago

    I ran 80,000 simulations of me taking a poop

    In 40,000 of them, shit ran down my ballsack and then I had shit on my balls.

    • Big_Bob [any]
      ·
      2 months ago

      In 32 of them, I sneezed in the middle of a stream of diarrhea and covered the entire backside of the toilet.

  • Coolkidbozzy [he/him]
    ·
    2 months ago

    homie's monte carlo analysis probably took like 9 seconds to run

    • hexaflexagonbear [he/him]
      ·
      2 months ago

      Based on my coworker's workflow, the simulations took up all computing resources they had all day, and the confidence interval was like 0.1% tighter.

  • Josephine_Spiro [she/her]
    ·
    2 months ago

    I flippee a coin and it landed on heads 40,012 times, here's how Harris can still win

    • Leon_Grotsky [comrade/them]
      ·
      2 months ago

      We surveyed the Adeptus Astra Telepathica and every seer came back with the same answer: landslide victory for the Emperor of Mankind!

      Praise be the God Emperor!

    • FALGSConaut [comrade/them]
      ·
      2 months ago

      Of course you have to vote for the God Emperor! Sure he's genociding everyone who isn't human (and quite a few people that are but shush) but if you don't vote for him then Horus will win! And Horus is going to be so much worse, he'll implement project 025.M42 and abolish the planetary governors! The God Emperor can win if you vote for him!

      (I may have mixed my 40k and 30k for the bit, shhh)