Formerly u/CanadaPlus101 on Reddit.

  • 1 Post
  • 390 Comments
Joined 3 年前
cake
Cake day: 2023年6月12日

help-circle

  • In the end we inplemented NoTaD pointers (“notified on target destruction”, essentially weak pointers but this was back in the day when weak pointers and smart pointers weren’t really well defined) that would discover when the thing they took a precious pointer to was actually no longer valid.

    It’s weird to me that programming practice has changed that much in 20 years. That’s still closer to today than to Dennis Richie doing his thing.



















  • I get OP was a joke, but I was trying to make a serious observation.

    Say you have some kind of stochastic algorithm that works on the assumption it’s fed a composite number most of the time. Maybe something like Pollard’s Rho algorithm, where whatever number theoretic structure you need accumulates slowly over time as a result. You decide to just pick a large number at random for each iteration.

    Implicitly, you’ve solved the problem of finding a composite number by assuming all (large) numbers are composite, like in this post. It is pretty close, like also mentioned in this post. If that’s not good enough, you could also use a primality test that fails some small portion of the time, which do exist, and use less power than guaranteed tests.