Re: Yet another contribution to the P-NP question

On Thu, 2024-09-26 at 00:04 +0000, nnymous109 wrote:

I know the reputation that claims like these get, so I promise, I didn't
want to do this. But I've spent quite some time working on this document
that I feel it would be a shame if I didn't, at least, get it
criticized.
 
As you can probably tell, I have little formal education in Math or
Computer Science (though I would really like some), so I am not very
confident in the argument I have come up with. I also haven't been able
to get someone else to review the work and give feedback, so there might
be obvious flaws that   I have not picked up on because they have
remained in my blind spots.
 
In the best case, this may still be work in progress, so I will be
thankful for any comments you will have for me. However, in the more
than likely scenario that the argument is fundamentally flawed and
cannot be rescued, I apologize beforehand for having wasted your time.
 
I have placed the document in a Figshare project, and here is the DOI:
10.6084/m9.figshare.27106759

I can't get the copy, can't say too much.
 
This is my proof that P!=NP (in Chinese)
https://sourceforge.net/projects/cscall/files/MisFiles/PNP-proof-zh.txt/download
The English version is not updated (but the basic idea is the same)
https://sourceforge.net/projects/cscall/files/MisFiles/PNP-proof-en.txt/download

I think my proof have presentation problems as a formal proof, but the goal is
for myself only, so not a real problem for me (P-NP problem is very tricky to 
prove, mightbe worse than the "0.999...==1" false belief).

By the way, "repeating decimal is irrational" (because, in short, statement
"ℚ+ℚ=ℚ" only valid in finite steps of application.. ... Contemporary axiomatic
system has a serious problem, ALL EXISTING PROOFS or knowledge should be re-examined).