Lucifer1904
Well-Known Member
That is correct actually because this is a computer science question that no one has ever solved. I have done my research and it is the cure for lag.
-
We are looking for you! Always wanted to join our Supporting Team? We are looking for enthusiastic moderators!
Take a look at our recruitement page for more information and how you can apply:
Can you solve this for 10,000 FP?
- Thread starter Lucifer1904
- Start date
DeletedUser28503
DeletedUser25273
My guess is he as actually asking for the solution to the question if the set of all Polynomial-time solvable problems (P) is equal to the set of all problems that can be verified in Polynomial-time (np, for non-deterministic polynomial-time). This is a major problem in computer science, and solving it will get you much more the 10,000 FP.
DeletedUser28503
Thats not what he asked. np does not equal NP
Lucifer1904
Well-Known Member
Yes that is correct. Anyone who can answer it will be paid $1 M
DeletedUser8152
Aw, I was trying to figure that out, but there were a whole bunch of wikipedia pages I had to visit and I couldn't figure out the optimal order
DeletedUser28503
That had to be the funniest one I have seen yet.Aw, I was trying to figure that out, but there were a whole bunch of wikipedia pages I had to visit and I couldn't figure out the optimal order
