Say, if someone asks for a code-golf like this:
Test primality under polynomial time
Given a positive integer, test whether it is prime.
The algorithm must have polynomial time complexity in respect to the number of digits of the input.
The algorithm must be deterministic.
Input type and format doesn't matter, but it must be able to represent arbitrary-length integers. In Haskell.
Integeris an example. In C++, since it doesn't natively support arbitrary-length integers,
std::stringwith ASCII digits would be acceptable.
If the input isn't a positive integer, it falls in don't care situation.
This will force everyone to implement AKS Primality Test, if their language doesn't have a builtin for it. Can such thing be accepted?