> As additional problems, the author appears to conflate the P vs. NP problem with the question of whether NP-complete problems can be efficiently solved in the

> As additional problems, the author appears to conflate the P vs. NP problem with the question of whether NP-complete problems can be efficiently solved in the physical world, a common novice mistake. This occurred to me as well just reading the article. Take an algorithm taking roughly G * x time and another taking e ^ (x/G) where G is the Graham number. Just because the first is growing in a linear fashion and the latter in exponential it doesn't mean the first will be quicker for any number physicians need to deal with.