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:
Anonymous2010-01-01 10:40
The most entertaining situation would probably be to find a algorithm that seemed to give answers in P time, but be unable to prove it did.
You could revolutionize the world of practical computer science, and still not be able to claim a single prize.