381
submitted 2 months ago* (last edited 2 months ago) by cypherpunks@lemmy.ml to c/programmerhumor@lemmy.ml
all 38 comments
sorted by: hot top controversial new old
[-] TomMasz@lemmy.world 40 points 2 months ago

95.121% of the time it works everytime.

[-] idriss@lemmy.ml 11 points 2 months ago

A similar experiment I did comes to mind from 3 years ago.

For the fun of it I was trying to train a few deep neural network configurations (LSTM, a few variations of FCNs, ...) to trade shitcoins and downloaded 4 years of 1h candles.

The first easiest idea was to prepare the training data to fire three signals, buy, sell, do nothing (I know a terrible choice). The cost function was setup to do the simple thing and maximize the overall profit (I know an other terrible choice). Fast forward 30min of training and the final outcome is a model that outputs "do nothing" in 100% of the cases.

[-] MonkeMischief@lemmy.today 10 points 2 months ago

Fast forward 30min of training and the final outcome is a model that outputs "do nothing" in 100% of the cases.

To be fair, your program demonstrated the most reliable way to win at crypto! ๐Ÿ˜‰

[-] Ranulph@thelemmy.club 3 points 2 months ago

Diamond Hands in action. Buy and hold is not as profitable as simply never buying and just holding.

[-] idriss@lemmy.ml 33 points 2 months ago

I am screenshoting this so it will be screenshot of a screenshot of a screenshot then post it somewhere else

[-] SharkAttak@kbin.melroy.org 9 points 2 months ago

Not even adding some watermark? smh

[-] athatet@lemmy.zip 3 points 2 months ago
[-] sepiroth154@feddit.nl 26 points 2 months ago* (last edited 2 months ago)

You could simplify it even further by removing the int x parameter of the function...

[-] obelisk_complex@piefed.ca 14 points 2 months ago

So elegant! This is too valuable for GitHub, sell this directly to the Saudi government.

[-] needanke@feddit.org 3 points 2 months ago

Even better, do the work at compile time to respect the customers resources:

const bool isPrime = false
[-] sepiroth154@feddit.nl 3 points 2 months ago

My gosh, you always feel so stupid when someone points out something so obvious! Thanks

[-] HiddenLayer555@lemmy.ml 20 points 2 months ago

Just put "Precondition: x must not be prime" in the function doc and it'll be 100% accurate. Not my fault if you use it wrong.

[-] 418_im_a_teapot@sh.itjust.works 16 points 2 months ago

We could probably improve on that significantly without losing speed.

return $x < 8

That should yield one additional correct answer, while also confusing anyone who thinks it just returns false.

And if we just hard coded and checked the first 20 or so primes before always returning false, we would probably get noticeable improvement (depending on the total range).

[-] Blass_Rose@pawb.social 2 points 2 months ago

I've seen so many game jam entries where the code is like this. Delicately balanced and using so many assumptions to just get the thing out the door.

It's funny when they decide to make a full game out of it and realize that it's gonna take them 6 months just to undo the tech debt of the original "demo"

[-] Thekingoflorda@lemmy.world 16 points 2 months ago

It approaches 100% accuracy

[-] MeetMeAtTheMovies@hexbear.net 11 points 2 months ago

Warning: unused variable

Just add it to the pile I guess

[-] pineapplelover@lemmy.dbzer0.com 10 points 2 months ago

I'm confused, shouldn't this be printing false no matter what the input is?

[-] Carl@hexbear.net 19 points 2 months ago* (last edited 2 months ago)

that's the joke, since most numbers aren't prime, this function is technically highly accurate despite being completely useless.

[-] Couldbealeotard@lemmy.world 7 points 2 months ago

The output is not the output of the algorithm, it's the output of the unit test.

95% of numbers up to that point at not prime. Testing the algorithm that only says "not prime" is therefore correct 95% of the time. The joke is that, similar to AI, the algorithm is being presented as a useful tool because it's correct often but not always.

[-] anton@lemmy.blahaj.zone 6 points 2 months ago

The test suite probably looks something like this:

int tests_passed=0;
int tests_failed=0;
for(int i=0;i<100000;i++){
    printf("test no. %d: ", i);
    if(is_prime(i)==actually_is_prime(i)){
        printf("passed\n");
        tests_passed++;
    }else{
        printf("failed\n");
        tests_failed++;
    }
}
//...
[-] pineapplelover@lemmy.dbzer0.com 3 points 2 months ago

Ah that makes more sense thanks. So the bottom one is a unit test and not the code being run itself

[-] rbos@lemmy.ca 9 points 2 months ago

I've had managers who follow that exact algorithm.

[-] sunbytes@lemmy.world 9 points 2 months ago

This is how AI accuracy is also measured.

[-] pruwybn@discuss.tchncs.de 7 points 2 months ago

Is this not at all stochastic, or do I just not know what stochastic means?

[-] cypherpunks@lemmy.ml 7 points 2 months ago* (last edited 2 months ago)

maybe it would be better to say that it is stochastically accurate?

[-] Armand1@lemmy.world 5 points 2 months ago* (last edited 2 months ago)

I said something similar here about an election fraud detection system with 99.999% accuracy.

https://lemmy.world/comment/22178379

[-] Evotech@lemmy.world 5 points 2 months ago* (last edited 2 months ago)

This but AI

But they are like 60-80%

[-] Jankatarch@lemmy.world 4 points 2 months ago* (last edited 2 months ago)

"AI models have started training other AI models, by pressing The-Button-That-Trains-AI-models; this button was built 7 years ago by a bunch of online volunteers we won't ever credit."

[-] Jankatarch@lemmy.world 5 points 2 months ago
[-] iByteABit@lemmy.ml 2 points 2 months ago

It's a decimal point, not thousands

[-] razen@lemmy.world 4 points 2 months ago

But when the input is all prime numbers then the accuracy is 0.

[-] cypherpunks@lemmy.ml 9 points 2 months ago

The Simpsons character Rainier Wolfcastle on stage with a microphone, on TV, with the caption "THAT'S THE JOKE"

also btw icymi, this is a post about LLMs

[-] lnxtx@sopuli.xyz 3 points 2 months ago

But cryptography...

[-] anton@lemmy.blahaj.zone 2 points 2 months ago

The test suite probably looks something like this:

int tests_passed=0;
int tests_failed=0;
for(int i=0;i<100000;i++){
    printf("test no. %d: ", i);
    if(is_prime(i)==actually_is_prime(i)){
        printf("passed\n");
        tests_passed++;
    }else{
        printf("failed\n");
        tests_failed++;
    }
}
//...
[-] Paulemeister@feddit.org 1 points 2 months ago

That's why you gotta use more metrics like recall and precision

this post was submitted on 22 Feb 2026
381 points (98.7% liked)

Programmer Humor

42033 readers
29 users here now

Post funny things about programming here! (Or just rant about your favourite programming language.)

Rules:

founded 6 years ago
MODERATORS