Re^2: Prime Number Finder

[blokhead]

Nice succinct algorithm, but I must take issue with

There's an interesting O(1) algorithm

You do have to execute the algorithm on a classical computer, so Q::S or not, it's most definitely not O(1). It'll be exponential (in the number of bits in $n) because behind the scenes, Q::S is dividing $n by all possible factors (what else could it be doing?). But even on a quantum computer, you still need either a division or gcd circuit (and probably a lot of other stuff), which will take some polynomial time in the number of bits.

Just because it's a one-liner doesn't make it O(1). Anyway, my favorite cutesy inefficient primality checker is

sub is_prime {
   ("1" x $_[0]) !~ /^(11+)\1+$/
}

[Roy Johnson]

some polynomial time in the number of bits.

If the number of bits is constant, then any polynomial time based on it is constant.

[blokhead]

If the number of bits is constant, then any polynomial time based on it is constant.

Big-O statements (like an algorithm taking constant or O(1) time) are statements about asymptotic behavior, i.e, how the function behaves in the limit (usually, as input size tends to infinity). If you don't look at them in the limit, then big-O-ish language (like constant time) is meaningless.

How meaningless? Even undecidable languages have a constant time "algorithm" if you consider the input size to be held to a constant. So without viewing things in the limit, all problems become computationally equivalent in the asymptotic language.

Update: added citation from parent node

[gu]

You're right, blokhead. I came to conclusions too fast after reading Q::S documentation. I think the documentation is badly formulated about this point, too.

Thanks for correcting.

[Roy Johnson]

It is reasonable to assume that some inputs will vary from 1 to very large. I do not agree with you that it is reasonable to assume that input numbers will in this case. There will be some interesting size of number, and not much variation around it.