Hacker News new | ask | show | jobs
by jonathanstrange 2947 days ago
Wait a minute, if the paper correctly links a theoretical definition of efficiency to the complexity class and indeed shows that markets can be efficient only iff. P=NP, then any future proof that P!=NP falsifies the thesis that markets are efficient. And most experts agree that if we ever get a proof, then it will be a proof of NP!=P.

Knuth is a notable exception, although he has to my knowledge never really vigorously advocated P=NP but merely suggested the possibility that P=NP and that the algorithms to transform NP problems into P problems could be very, very complex but still in P. Seems unlikely, though.

1 comments

The paper doesn't even manage to prove that finding a significantly profitable technical strategy is in NP.