The concept of proving NP completeness through non-constructive methods is discussed, though traditionally an algorithm would be needed to prove such a thing. The Riemann hypothesis and the Poincaré conjecture, one of the seven Millennium Prize Problems, are also mentioned.