This whole reasoning only makes sense if you take P to mean "easy to solve". In reality, P=NP would almost certainly not have any bearing on evolution or even c

This whole reasoning only makes sense if you take P to mean "easy to solve". In reality, P=NP would almost certainly not have any bearing on evolution or even computing. It's basically certain at this point that any polynomial time program that solves an NP complete program will have a large exponent, say it will be O(n^10), which for all intents and purposes makes it just as intractable as O(e^n). P=NP is an extremely important and deep theoretical problem, but it is very unlikely to have direct practical implications.