P vs. NP: The Unsolvable(?) Computer Science Problem

Channel:
Subscribers:
16,800
Published on ● Video Link: https://www.youtube.com/watch?v=37JDPiJbXmM



Duration: 13:37
8,340 views
581


Keep exploring at http://brilliant.org/Truttle1/. Get started for free, and hurry—the first 200 people get 20% off an annual premium subscription.

Even though computers are able to draw and write poetry now, there are still unsolved problems in computer science. I'm not talking about unsolvABLE problems like the halting problem, but problems like the P vs. NP problem, which is probably solvable but a solution hasn't been found. Will you figure it out? If you do, you will win one million dollars. That is not a joke.

MUSIC USED:
Uptown Down from SimCity 3000
Gloam Valley from Super Paper Mario
Steam Gardens from Super Mario Odyssey
Beachside Dream from Mario and Luigi: Bowser's Inside Story
Dimble Woods Part II from Mario and Luigi: Bowser's Inside Story
Snow Kingdom from Paper Mario: Sticker Star
Itty Bitty 8 Bit by Kevin MacLeod
Bob-Omb Battlefield from Super Mario 64

VIDEO USED:
Super Mario Bros. Gameplay: https://www.youtube.com/watch?v=7qirrV8w5SQ
Super Mario Odyssey Gameplay: https://www.youtube.com/watch?v=03e7mvY6uws







Tags:
Computer Science
P vs NP
Unsolved Problem
P vs NP Problem
Clay Mathematics Institute
3n+1
3x+1
P = NP
P != NP
Time Complexity
Big O Notation