Рет қаралды 157,871
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:
github.com/llS...
Nichole's winning code:
github.com/nhr...
Mick's runner-up code:
github.com/mic...
Join the Wizard's Slack Channel:
wizards.heroku...
Some more great P vs NP resources:
danielmiessler...
qntm.org/pnp
news.mit.edu/20...
blog.codinghor...
/ the-astounding-link-be...
Please subscribe! And like and comment and share. That's what keeps me going.
And please support me on Patreon!
www.patreon.co...
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! :
www.Azadux.com...
www.Uploadcoll...
Follow me:
Twitter: / sirajraval
Facebook: / sirajology Instagram: / sirajraval Instagram: / sirajraval
Signup for my newsletter for exciting updates in the field of AI:
goo.gl/FZzJ5w
Hit the Join button above to sign up to become a member of my channel for access to exclusive content! Join my AI community: chatgptschool.io/ Sign up for my AI Sports betting Bot, WagerGPT! (500 spots available):
www.wagergpt.co