CATEGORY:
Show Me the Physics! Video Contest (2014)
[back]
TOPIC:
Physics Resolution to the P vs NP problem by Daegene Song
[refresh]
Login or
create account to post reply or comment.
Daegene Song wrote on Aug. 22, 2014 @ 19:06 GMT
Video Image
Video URLhttp://www.youtube.com/watch?v=cdSElM_UTX4Video DescriptionPhysics could help to solve the P versus NP problem, one of the seven millennium math problems presented by the Clay Institute in 2000. The idea is to construct a real-world NP computer, which has existed only as imagination so far, and show if it is equal to P computers—that is, ordinary computers.
Video Creator Bio Daegene Song now teaches at the Korea University of Technology & Education. He has worked on various topics in the field of quantum computation. www.subjectiveuniverse.org
Neil Sardesai wrote on Sep. 10, 2014 @ 22:10 GMT
Well, I learned something new today. Didn't even know what P and NP were until now. I'm studying computer engineering in college, so stuff like this is really relevant and interesting. So thanks for making this video!
Also, would you mind rating and reviewing my video? I attempt to generate interest in studying physics by showing how cool physics really is. http://fqxi.org/community/forum/topic/2148
Best of luck in the competition!
Schatzie Dudee wrote on Sep. 12, 2014 @ 18:31 GMT
That was really neat! I love the graphics and really easy to understand explanation of a very difficult concept.
If you can, please rate our 2 videos if you have a moment:
http://fqxi.org/community/forum/topic/2230 and
http://fqxi.org/community/forum/topic/2167
Thanks again!
Schatzie Dudee
Robert L Bender wrote on Sep. 18, 2014 @ 15:04 GMT
Great VIDEO!!! I Loved the way you animated the talking characters. Also, The P NP problem is very new to me!! thank you for sharing!!
Sorana Dana Stoica wrote on Sep. 25, 2014 @ 10:27 GMT
Your video is very interesting, and I loved it!
My video is
A universe in a cup of water, I hope you will like it too.
I wish you success!
Victor
Ian C Harris wrote on Sep. 25, 2014 @ 17:03 GMT
Very interesting way of presenting your information!
I hope you do well in the competition. If you get a chance please stop by and check out/ rate out video as well
http://fqxi.org/community/forum/topic/2189
Thanks
Ian Harris
Nick Mann wrote on Nov. 4, 2014 @ 22:23 GMT
"P=NP" actually means that any problem whose solution can be efficiently verified by a deterministic or nondeterministic computer can also be efficiently solved by a nondeterministic computer.
So in order to prove P=NP, the nondeterministic computer would need to efficiently solve NP-Complete problems. That's a much higher bar than merely matching the performance of an ordinary deterministic computer, which a nondeterministic computer could easily do. It's too early to collect the million bucks.
Login or
create account to post reply or comment.