- 2
- 3 467 100
hackerdashery
Registrace 9. 11. 2008
P vs. NP and the Computational Complexity Zoo
Hackerdashery #2
Inspired by the Complexity Zoo wiki: complexityzoo.uwaterloo.ca/Complexity_Zoo
For more advanced reading, I highly recommend Scott Aaronson's blog, Shtetl-Optimized: www.scottaaronson.com/blog/
-----
Retro-fabulous, cabinet-sized computers:
System/360: en.wikipedia.org/wiki/IBM_System/360
photo: "360-91-panel". Licensed under Public domain via Wikimedia Commons - commons.wikimedia.org/wiki/File:360-91-panel.jpg#mediaviewer/File:360-91-panel.jpg
PDP-8: en.wikipedia.org/wiki/PDP-8
photo: "PDP-8". Licensed under Public domain via Wikimedia Commons - commons.wikimedia.org/wiki/File:PDP-8.jpg#mediaviewer/File:PDP-8.jpg
-----
Protein folding illustration: "Protein folding schematic" by Tomixdf (talk) - Own work (Original text: “self-made”). Licensed under Public domain via Wikimedia Commons - commons.wikimedia.org/wiki/File:Protein_folding_schematic.png#mediaviewer/File:Protein_folding_schematic.png
P vs. NP opinion poll: www.cs.umd.edu/~gasarch/papers/poll2012.pdf
Inspired by the Complexity Zoo wiki: complexityzoo.uwaterloo.ca/Complexity_Zoo
For more advanced reading, I highly recommend Scott Aaronson's blog, Shtetl-Optimized: www.scottaaronson.com/blog/
-----
Retro-fabulous, cabinet-sized computers:
System/360: en.wikipedia.org/wiki/IBM_System/360
photo: "360-91-panel". Licensed under Public domain via Wikimedia Commons - commons.wikimedia.org/wiki/File:360-91-panel.jpg#mediaviewer/File:360-91-panel.jpg
PDP-8: en.wikipedia.org/wiki/PDP-8
photo: "PDP-8". Licensed under Public domain via Wikimedia Commons - commons.wikimedia.org/wiki/File:PDP-8.jpg#mediaviewer/File:PDP-8.jpg
-----
Protein folding illustration: "Protein folding schematic" by Tomixdf (talk) - Own work (Original text: “self-made”). Licensed under Public domain via Wikimedia Commons - commons.wikimedia.org/wiki/File:Protein_folding_schematic.png#mediaviewer/File:Protein_folding_schematic.png
P vs. NP opinion poll: www.cs.umd.edu/~gasarch/papers/poll2012.pdf
zhlédnutí: 3 402 962
Video
Hackerdashery #1
zhlédnutí 64KPřed 11 lety
In which I bite off more than I can chew, and chew like hell.
If we solve protein folding we can cure cancer...
P = NP even polynomial term formula. P ≒ P Approximation Value.
Point of the amazing.
background song ????
Recommended from Udemy.
What an amazing video!
How about changing your view on how you see the problem, maybe the basis you use to solve other problems is different from what you are solving now, maybe you need to change on how you see the problem and start from scratch in order to solve your problem, and not rely much on the solutions that solve the problems entirely different on the problem you need to solve. This help me once when I had a really confusing and hard math problem. Just change the way you see the problem and start from scratch.
stupidest shit ever these guys gonna die on this shit with this retarded approach a gradation
Brother, the music is a bit intrusive, hard to concentrate. Peace!
If I had the answer I'd steal the price money just to prove my point
I was praying the background music would subside at some point 🥴
Thanks!
Hey, if you died today, where would you go? Jesus Christ said no one comes to God, His Father except through Him. All have sinned, and done evil in front of God who is a righteous judge, but Jesus died for your sins, taking your penalty for the evil you did, and it is written, if you will confess with your lips, Jesus is Lord and believe in your heart God raised Him from the dead, you shall be saved. Ask Jesus to hear His voice speaking to you, because God still speaks to His people, and Jesus's sheep hear His voice.
Comments section should be restricted for most of these people commenting.
Awww, so sweet.
Tysm I needed to understand what is all those classes of language
Dude I just asked you if you want milk in your coffee
❤❤❤
You got on the Mario Wiki.
Aren't Rubik's cubes np? Most computer "solves" are actually un-scrambles, and are trivially complex.
In this order as follows: 1. Stephen M. Novak 2. Lee Buttril 3. William Rebrook IV 4. William Saunders 5. Tiffany Fry 6. Jenni Genrich 7. Matthew Von Fricken 8. John Stickler 9. Leroy aka Michael Shultz 10. Matthew Rensch With over 70% or more having served in the Armed Forces here in America and now responsible for the creation and promotion of terrorism right here in America.
This is the best thing I've ever seen in my entire life. It is better than any movie ever made. Better than any TV show you watched. Better than any lecture you attended. This is peak lecturing and peak entertainment.
9 years ago..... i wonder where he is and how hes doing
the video ends so philosophical... i love it
Anyone know the background song name?
Great video!
You just uploaded 2vids😢
Amazing Visuals! Thank you.
So how is AI going to take over? If computers are so dumb
P = NP hard problem solution P = NP completeness pointing re-written number cross.
So beautifully put, I have goosebumps. Fascinating. It's like listening to a powerful Vedic mantra or a transcendental poetry.
this is the best explanation I've seen-- thank you for saving me in my algorithms class lol
next months well 10 years
Fast protein folding has not helped us cure cancer...
well,maybe their is much on it
I just realized you only posted 2 videos in 10 years. That's a shame.
This video is exceptional. Thanks for sharing.
The whole channel contains only two videos he is probably not among us anymore or he will return with the solution to p vs np problem.
Who’s here to see if we solved N = NP?
Excellent video. The P vs. NP conundrum is explained very clearly.
great video! thank you for the explanations that significantly improved my university lectures
A specific Rubik's cube is an unintuitive example, since 100% of people can tell if a Rubik's solution is correct, but only a small number could solve a scrambled one; in human terms it _looks_ like an NP problem since it's so much easier to check correctness than to do. Yet in terms of computers, it's in P.
Damn. I was not able to understand a single comma about what are being saying. What do you suggest me, besides killing myself?
where did you go man?
If we were to prove that P=NP, I dont get how this would help us solve big problems in biology, cryptology etc overnight. Being able to verify solutions doesn give us the means to find them in the first place. Even if we know that a problem's solution can be checked as quickly as the problem can be solved, Idont see how this would bring us any closer to the actual solution. Can someone explain this?
"Being able to verify solutions doesn't give us the means to find them in the first place." This hasn't been proven true or false. This is entirely what the P vs NP problem is about. (Although most people think P != NP) Cryptology is secure because is it based on the assumption that P != NP. No one knowns a polynomial time algorithm to crack encryption. But if P=NP, then that means there IS a polynomial time algorithm. If we were to discover such an algorithm, cryptology as we know it would become useless. But it would also have huge benefits, like protein folding.
@@Grimlock1979 idk it seems like merely KNOWING that a encryption-breaking polynomial time algorithm exists, and the process of actually discovering such an algorithm are two different things, if lets say tomorrow we were to prove that P=NP, then would that automatically give us the encryption-breaking algo? Or are you saying the process of proving that P=NP involves finding the algo in the first place? im confused
@richardtobing5012 No, if someone proves P=NP that does not necessarily mean we have an algorithm. It's just my hunch that says, if we prove P=NP, it will involve finding an algorithm. But my hunch first and foremost says that P!=NP. If we proof P!=NP then at least we can stop spending the time and energy trying to find an algorithm.
yeah, that makes sense@@Grimlock1979
I don’t even have a bachelor’s degree, this is a great video!
Hello everyone from Professor Chung's COM304 class
Can't we use an algorithm from p and set it to p = NP and the problem is over?
Great video, just a tiny remark. Solving chess is PSPACE-complete, so we may as well find a polynomial time solution to this one (we still do not know if P is substantially different from PSPACE).
7:49 i can cure cancer with food and sound. 😅😅😅😅
if you had infinite storage all NP would be P, beacuse you could just indexing every possibile matches of chest or sudoku, ad retrive the best result easly. otherwise some NP can't be P because of the causality low . but maybe with quantum computing we can overcome causality in calculation.