That seems extremely harsh criticism. The paper is clearly not written
for /you/, or anyone else who is not already familiar with
graduate-level mathematics in the field of complexity theory. For
papers at this level, you might expect perhaps a dozen people in the
world will be able to read it reasonably fluently and understand it as
they do so - most experts in the same field will take days or weeks to
study through it to see how it works. It will be months, perhaps years,
before there is a consensus in the mathematical community about its
correctness and the almost inevitable small errors or missing
justifications. Proving P ≠ NP is a big deal - it is so important, and
so hard, that there is a million dollar prize resting on it.
Mathematicians have their own way of writing and their own symbolic
languages - just because /you/ don't understand them, does not make them
"hopeless" or "retarded". There is nothing in that article that is
remotely complex in the symbols. Beyond the first couple of pages, the
paper is way out of my league - but the use of symbols seems entirely
reasonable.
If I had one complaint, it would be that the text is too compact. The
paper would benefit from a good deal more white space and perhaps some
examples of the terms and definitions (mathematicians are rightly wary
of examples - it is too easy to assume generalisations from them).
This paper - if it is shown to be valid - is a milestone in the
computing world. If it is contains flaws, it will join the growing list
of failed proofs for P ≠ NP, but perhaps help someone else move forward.