Hacker News Reader

Does having a proof of P=NP necessarily mean that you can write the code to solve NP problems though?

Not necessarily, but it's hard for me to imagine what a non-constructive proof of P=NP would look like.

What do you image a constructive proof looking like?

It would look like an algorithm that solves an NP-complete problem in polynomial time. (Isn't that obvious?)

Sure. And why does that seem any more feasible than a non-constructive proof?

I don't know. Why is the moon plaid?

> Not necessarily, but it's hard for me to imagine what a non-constructive proof of P=NP would look like.

Have a look at the proof of the Robertson-Seymour theorem. Here the Wikipedia section about its importance in complexity theory:

Interesting. Thanks!