post
You could simplify it even further by removing the int x parameter of the function...
95.121% of the time it works everytime.
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! 😉
Diamond Hands in action. Buy and hold is not as profitable as simply never buying and just holding.
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.
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).
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"
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++;
}
}
//...
Is this not at all stochastic, or do I just not know what stochastic means?
I said something similar about an election fraud detection system with 99.999% accuracy.
This but AI
But they are like 60-80%
But when the input is all prime numbers then the accuracy is 0.
...95.121%
???
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++;
}
}
//...

all 30 comments