[SunkenCiv]

There's an important alternative to Clarke's Third Law -- any mathematical proof sufficiently complicated is indistinguishable from magic." ;')

...the latest attempt to prove P ≠ NP -- otherwise known as the "P vs NP" problem -- seems to be running into trouble... The problem concerns the speed at which a computer can accomplish a task such as factorising a number. Roughly speaking, P is the set of problems that can be computed quickly, while NP contains problems for which the answer can be checked quickly... It is generally suspected that P ≠ NP. If this is so, it would impose severe limits on what computers can accomplish.

[decimon]

To P or not to P: ay, there is the rub.