Featured Vid #358 – P vs. NP and the Computational Complexity Zoo

1 Star2 Stars3 Stars4 Stars5 Stars (No Ratings Yet)

Believe it or not, there’s an organization set up for the strict purpose of giving out prizes of 1 million dollars to people. Not for free, though; all one has to do is solve one of the 10 unsolved mathematical puzzles that the organization has picked out, including Reimanns Hypothesis and the Poincaré Conjecture. Seems easy? Think again. These puzzles are picked for the specific reason that no mathematician has been able to solve it, despite many around the world taking a crack at them. Only one problem has been solved so far, but that doesn’t stop people from trying.

One of the most interesting and easy-to-understand of the problems is the P vs. NP problem, known for being more applicable and profound than most computational conundrums. In this great video by Hackerdashery, they explain the problem of P vs. NP in a very informative and eye-opening way, showing that math has more to do with the world around us than we might think.


Add Comment