News for hackers. Stuff that matters.
Re:A Solution of the P versus NP Problem? by rickbradley on Tuesday August 15, 2017 @12:30AM (#15015494)
I see a few typos in the wording of the paper (e.g., "spezify", "touchs", etc.). While this doesn't mean much, I would expect if the paper had gotten a fine-toothed comb review that these sorts of typos would have been caught. Moving back to the "not holding my breath" stance unless there start to be indications from experts in the field that the claims are holding up.
Re:A Solution of the P versus NP Problem? by Houshalter on Tuesday August 15, 2017 @02:11AM (#15015926)
I can forgive imperfect English. He's not a native English speaker and his reviewers probably are not be either.
Re:A Solution of the P versus NP Problem? by rav on Tuesday August 15, 2017 @01:20AM (#15015720)
The paper is on arXiv, so we don't know if it's gotten a fine-toothed comb review yet. Furthermore, some reviewers seem to ignore those kinds of typos, which means a paper might have been reviewed carefully for the technical contents, but not at all for language.
Re:A Solution of the P versus NP Problem? by Myrmornis on Tuesday August 15, 2017 @04:52AM (#15016511)
It's on ArXiv, people are free to publish there without getting a language review. The author's first language is not English.