> "That completely misses the point of P vs. NP, which is not about programmability but a problem entirely of theoretical nature"
Yes, there is an important theoretical background, but IF you prove P==NP you should go for it (of course you can have n^a big number but that's unlikely)
> Cracking AES-256 is even easier than P: it's O(1)
Well, you can take any fixed size subset and say it's O(1), TSP for 100 cities is O(1) as well
But if the 'theoretical work' is merely to win grants and ensure tenure yeah, just don't bother.
Yes, there is an important theoretical background, but IF you prove P==NP you should go for it (of course you can have n^a big number but that's unlikely)
> Cracking AES-256 is even easier than P: it's O(1)
Well, you can take any fixed size subset and say it's O(1), TSP for 100 cities is O(1) as well
But if the 'theoretical work' is merely to win grants and ensure tenure yeah, just don't bother.