There are many NP hard problems in optimization. As a matter of fact, giving a program and find the fastest equivalent program (does the best optimization) in general is not just NP hard, but it is the same as solving halting problem. Just because it is hard they doesn't stop people to write compilers.
I haven't look into this for a long time, but I doubt the argument provided by this guy.