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:
[ Ссылка ]
Nichole's winning code:
[ Ссылка ]
Mick's runner-up code:
[ Ссылка ]
Join the Wizard's Slack Channel:
[ Ссылка ]
Some more great P vs NP resources:
[ Ссылка ]
[ Ссылка ]
[ Ссылка ]
[ Ссылка ]
[ Ссылка ]
Please subscribe! And like and comment and share. That's what keeps me going.
And please support me on Patreon!
[ Ссылка ]
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! :
[ Ссылка ]
[ Ссылка ]
Follow me:
Twitter: [ Ссылка ]
Facebook: [ Ссылка ] Instagram: [ Ссылка ] Instagram: [ Ссылка ]
Signup for my newsletter for exciting updates in the field of AI:
[ Ссылка ]
Hit the Join button above to sign up to become a member of my channel for access to exclusive content! Join my AI community: [ Ссылка ] Sign up for my AI Sports betting Bot, WagerGPT! (500 spots available):
[ Ссылка ]
