Odds are good that the paper that actually proves P != P (a) will be written in TeX, (b) will not include references to introductory algorithms textbooks, Wikip

Odds are good that the paper that actually proves P != P (a) will be written in TeX, (b) will not include references to introductory algorithms textbooks, Wikipedia pages, and lecture slides, (c) will not conclude by saying "There is no relevant related work on the goal to really solve the P versus NP question," (d) will not be littered with grammatical errors, and (e) will be written by an author who already has many publications on the arxiv. Which is not to say that there's no good thought in here...