Thats a great video to explain what P vs NP is but essentially P is a set of problems that have a easy/fast way to solve them. NP is the set of problems that when given a solution is easy/fast to check if it’s correct - we don’t know if the set of problems in NP are also P - if there is a problem that given a solution is easy to check, then is it also easy to solve and we just haven’t found the algorithm yet?
How does this remind me of yoyoing? With me, learning laceration bind took forever. I just couldn’t get it down. So I came here for help and with that I was able to land it. After landing it one time I was able to do it over and over. Ive found that to be the case with almost every trick. I spent hours attempting to finger spin to do the dna - took weeks. But the second I landed once it clicked and I was able to do it over and over. This reminds me of NP where its hard to solve but once you get the solution its easy to do. I wonder if it can be like P where a trick will be easy to learn where you can land it within a few attempts. Why is it easy to land only after you’ve landed a trick the first time?
I hope this was an interesting read its been making me think about the classic problem I learned awhile ago and all the other cool things that land in that realm like sudoku, chess and rubix cubes. Who knows maybe with Googles new quantum chip we can solve P vs NP and find out which one yoyo is in if it is at all.