Not really. The OP is arguing that translating this statement to the real world adds nothing we did not know before. In comparing markets with NP-complete problems an interesting (but still trivial after you get the idea) paper "Computational Complexity and Information Asymmetry in Financial Products" by Arora et al.
And, also, the point of this paper is not really interesting. Even if it takes exponential time for the market to reflect _all_ the available information about something, all the efficient market hypothesis says is that the market will incorporate the information as fast as the fastest agent in incorporating that information. And this has nothing to do with P and NP (since a quadratic market can still be beat by a linear agent, and this is a market that is definitely in P).
I haven't looked into modern computational complexity research a whole lot, but I suspect it gets a disproportionate amount of attention because of the historical successes and importance of the field. Kind of like particle accelerators and NASA.
It only become deeply unsatisfying and misleading for people who do not understand how to translate this information to the real world.
It seems from your post as you do have that understanding, but not the respect for the importance of the underlying math.