This is interesting, but it looks like this proves nothing according to the article since we don't know if P==NP. We are no closer to understanding whether or n

This is interesting, but it looks like this proves nothing according to the article since we don't know if P==NP. We are no closer to understanding whether or not a faster way to compute edit distance exists. All we know now is that it matches up to a class of problems that we _think_ are probably hard. It is still possible that we might find a faster solution to the problem. I'd like to request a title change - "New proof that a faster way to compute edit distance might be tied up in the P vs. NP problem"