- My Forums
- Tiger Rant
- LSU Recruiting
- SEC Rant
- Saints Talk
- Pelicans Talk
- More Sports Board
- Fantasy Sports
- Golf Board
- Soccer Board
- O-T Lounge
- Tech Board
- Home/Garden Board
- Outdoor Board
- Health/Fitness Board
- Movie/TV Board
- Book Board
- Music Board
- Political Talk
- Money Talk
- Fark Board
- Gaming Board
- Travel Board
- Food/Drink Board
- Ticket Exchange
- TD Help Board
Customize My Forums- View All Forums
- Show Left Links
- Topic Sort Options
- Trending Topics
- Recent Topics
- Active Topics
Started By
Message
Thoughts on the P versus NP problem?
Posted on 3/21/22 at 9:41 pm
Posted on 3/21/22 at 9:41 pm
quote:
Unsolved problem in computer science: If the solution to a problem is easy to check for correctness, must the problem be easy to solve?
quote:
The P versus NP problem is a major unsolved problem in computer science. It asks whether every problem whose solution can be quickly verified can also be solved quickly. The informal term quickly, used above, means the existence of an algorithm solving the task that runs in polynomial time, such that the time to complete the task varies as a polynomial function on the size of the input to the algorithm (as opposed to, say, exponential time). The general class of questions for which some algorithm can provide an answer in polynomial time is "P" or "class P". For some questions, there is no known way to find an answer quickly, but if one is provided with information showing what the answer is, it is possible to verify the answer quickly. The class of questions for which an answer can be verified in polynomial time is NP, which stands for "nondeterministic polynomial time".
quote:
The problem is considered by many to be the most important open problem in computer science.[1] Aside from being an important problem in computational theory, a proof either way would have profound implications for mathematics, cryptography, algorithm research, artificial intelligence, game theory, multimedia processing, philosophy, economics and many other fields.[2] It is one of the seven Millennium Prize Problems selected by the Clay Mathematics Institute, each of which carries a US$1,000,000 prize for the first correct solution.
Does P = NP or does P =/= NP? If you can easily plug in numbers to check your solutions, does that necessarily mean the problem is easily solvable?
14
Posted on 3/21/22 at 9:42 pm to UndercoverBryologist
I thought NP was nipple protrusion.
Posted on 3/21/22 at 9:42 pm to UndercoverBryologist
Pussy>>>>No Pussy
Posted on 3/21/22 at 9:44 pm to UndercoverBryologist
Example to help people wrap their brain around the question:
quote:
Although the P versus NP problem was formally defined in 1971, there were previous inklings of the problems involved, the difficulty of proof, and the potential consequences. In 1955, mathematician John Nash wrote a letter to the NSA, where he speculated that cracking a sufficiently complex code would require time exponential in the length of the key.[5] If proved (and Nash was suitably skeptical) this would imply what is now called P ? NP, since a proposed key can easily be verified in polynomial time.
Posted on 3/21/22 at 9:44 pm to UndercoverBryologist
quote:
Does P = NP or does P =/= NP? If you can easily plug in numbers to check your solutions, does that necessarily mean the problem is easily solvable?
Posted on 3/21/22 at 9:45 pm to UndercoverBryologist
quote:Most Computer Scientists fall squarely into the No Poontang (NP) camp.
The P versus NP problem is a major unsolved problem in computer science.
Posted on 3/21/22 at 9:46 pm to OysterPoBoy
quote:
I thought NP was nipple protrusion
Posted on 3/21/22 at 9:47 pm to UndercoverBryologist
I think I’m a reasonably smart guy but I don’t know what the frick any of this means
Posted on 3/21/22 at 9:48 pm to UndercoverBryologist
Will this help to refine the porn search algorithms? Asking for a friend .
Posted on 3/21/22 at 9:49 pm to UndercoverBryologist
P != NP
Otherwise there would be no more problems to solve
Otherwise there would be no more problems to solve
Posted on 3/21/22 at 9:49 pm to sweetwaterbilly
quote:
I think I’m a reasonably smart guy but I don’t know what the frick any of this means
Just know this: if P = NP, then there’s theoretically a very simple way of solving all encryption problems, meaning there’s theoretically a way to easily break into any computer security imaginable.
All encryption is based on NP, and simple operations like addition and subtraction are all P. If P = NP, then your bank account is fricked.
This post was edited on 3/21/22 at 9:52 pm
Posted on 3/21/22 at 9:53 pm to UndercoverBryologist
I explain PNP and NPN.
That's about it
That's about it
Posted on 3/21/22 at 9:54 pm to East Coast Band
quote:
explain PNP and NPN.
Posted on 3/21/22 at 9:56 pm to UndercoverBryologist
If you’re friends of P, well then you’re friends with me.
Posted on 3/21/22 at 10:09 pm to UndercoverBryologist
If anyone ever proves P = NP, it would be disastrous. Say goodbye to most modern encryption schemes.
Personally, I don't think P = NP, but I also don't think that can be proven.
Personally, I don't think P = NP, but I also don't think that can be proven.
Posted on 3/21/22 at 10:12 pm to LordSaintly
quote:
If anyone ever proves P = NP, it would be disastrous. Say goodbye to most modern encryption schemes.
On the other hand, it opens up a realm of possibilities of previously insurmountable computational problems in biology, economics, etc. becoming easily solvable.
Posted on 3/21/22 at 10:15 pm to UndercoverBryologist
You know, sometimes there are some really stupid people on this website. Then there are threads like these that make me feel extremely stupid.
Posted on 3/21/22 at 10:16 pm to UndercoverBryologist
quote:
All encryption is based on NP, and simple operations like addition and subtraction are all P. If P = NP, then your bank account is fricked.
The encryption geniuses at MIT believe we are at least 10 years away from finding the answer to this question so everyone’s data is safe for now.
Posted on 3/21/22 at 10:16 pm to LordSaintly
quote:
anyone ever proves P = NP, it would be disastrous. Say goodbye to most modern encryption schemes.
Would this impact the overarching principle of block chain: nothing is encrypted making it the most secure because everyone agrees it’s correct and true?
Posted on 3/21/22 at 10:24 pm to Oilfieldbiology
The negative aspect of the positive derides from the above proximity internal to the void of a conclusion. Adversely, P exists to diffuse the possibility that NP coagulates, expressing the two is ultimately convexed as a whole. 
Page 1 of 2
Popular
Back to top
Follow TigerDroppings for LSU Football News