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.
I said something similar here about an election fraud detection system with 99.999% accuracy.
Is this not at all stochastic, or do I just not know what stochastic means?
it would be clearer to say that it is stochastically accurate
I’ve had managers who follow that exact algorithm.
This but AI
I’m confused, shouldn’t this be printing false no matter what the input is?
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.
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++; } } //...Removed by mod
Removed by mod
It approaches 100% accuracy
95.121% of the time it works everytime.
deleted by creator
You could simplify it even further by removing the int x parameter of the function…
So elegant! This is too valuable for GitHub, sell this directly to the Saudi government.
I am screenshoting this so it will be screenshot of a screenshot of a screenshot then post it somewhere else
ifunny
Not even adding some watermark? smh
But when the input is all prime numbers then the accuracy is 0.
also btw icymi, this is a post about LLMs
True
But cryptography…
