Name:
Anonymous
2009-12-31 21:01
Do you still win the 1 million dollars if you show that P=NP (and thus P!=NP) is unprovable, as opposed to equal or unequal?
Name:
Anonymous
2009-12-31 23:45
Therefore, if it can't be proven that P=NP, P!=NP.
If P=NP is undecidable, then P!=NP is also undecidable.
But maybe it's possible that an algorithm could exist which decides NP-complete problems in P time, but no proof would exist for P=NP.