In this video, I explain perhaps the most famous problem in all of Computer Science. Does P = NP? I define the terms and give examples of each. We also programmatically go through the traveling salesman problem. I experiment with a little bit of mixed reality in this video as well.

Code for this video: https://github.com/llSourcell/p_vs_np_challenge

Nichole's winning code: https://github.com/nhrigby

Mick's runner-up code: https://github.com/mickvanhulst

Join the Wizard's Slack Channel: https://wizards.herokuapp.com/

Some more great P vs NP resources: https://danielmiessler.com/study/pvsnp/ https://qntm.org/pnp http://news.mit.edu/2009/explainer-pnp https://blog.codinghorror.com/the-girl-who-proved-p-np/ https://medium.com/the-physics-arxiv-blog/the-astounding-link-between-the-p-np-problem-and-the-quantum-nature-of-universe-7ef5eea6fd7a

Please subscribe! And like and comment and share. That's what keeps me going.

And please support me on Patreon! https://www.patreon.com/user?u=3191693

I used the Tilt Brush mixed reality app to draw the complexity classes for fun. Thanks Az Balabanian and the Upload Collective for letting me shoot videos in VR! : https://www.Azadux.com/mixed-reality https://www.Uploadcollective.com Follow me: Twitter: https://twitter.com/sirajraval Facebook: https://www.facebook.com/sirajology Instagram: https://www.instagram.com/sirajraval/ Instagram: https://www.instagram.com/sirajraval/