I’ve been thinking about this for days.

[ichinin@infosec.exchange]

@mhoye Algorithms like this are used as a pre-prime testing before you do the actual prime testing that requires CPU heavy computation.

[arcaneoverflow@techhub.social]

@mhoye @jonathankoren Snort!

[mehrad@fosstodon.org]

@mhoye
@jonathankoren
It is one of the best one-class classifier I've ever seen. Extremely efficient and the computational time doesn't grow the larger the input gets.

[ingonymous@mastodon.social]

@mhoye @Nephele @jonathankoren
That's prime crime

[stylus@social.afront.org]

@mhoye @silicatefondue @jonathankoren this class of algorithm is called the stopped clock algorithm. It joins the previously identified Monte Carlo and las Vegas algorithms.

[http@infosec.exchange]

@mhoye @jonathankoren If you change that to:
return !(x&1);
You have improved the probability quite a lot and still fast and won't get optimized away.

[mjdxp@labyrinth.zone]

@mhoye @jonathankoren amazing, we've discovered prime numbers past 2

[mschomm@bonn.social]

@jonathankoren Is there a use case for Bogosort?

[mhoye@cosocial.ca]

@mjdxp @jonathankoren This changes everything!

[mhoye@cosocial.ca]

@finestructure @jonathankoren oh shit you’re right

[yesbait@bsd.network]

@mhoye @jonathankoren can absolutely relate. Constantly trying convince my quantitative colleagues that discrete maths is different from their stochastic and AI based reasoning.

[tygerkrash@mastodon.ie]

@mhoye @jonathankoren thats fantastic.

[thelancashireman@hostux.social]

@mhoye @jonathankoren

Reminds me of another ...

float sin(float x) { return x; }

is remarkably accurate for a large proportion of the possible input values.

[execin@x0r.be]

@mhoye @jonathankoren
And it’s O(1) too!