Re: Is this ℙ≠ℕℙ proof 'humiliating'?

On Sun, 2024-06-09 at 20:55 +0100, Ben Bacarisse wrote:

wij <wyniijj5@gmail.com> writes:
 

ℙ≠ℕℙ Proved. https://sourceforge.net/projects/cscall/files/MisFiles/PNP-proof-en.txt/download
...[cut]
   Proof2: Let p="Given a number n, determine whether or not n is even". If
          ℙ=ℕℙ, then p∉ℕℙℂ is a false proposition because all ℕℙ problems
          including ℕℙℂ are mutually Ptime reducible. Since p∉ℕℙℂ is true,
          ℙ≠ℕℙ is concluded.

 
Where is your proof that p is not NP-complete?  Since you don't know
this subject very well, you would benefit more from asking people to
direct you to resources from which you could learn, rather than posting
provocative messages.

Barking only damages the image you desperately to manage in useset.
Is the word 'humiliating' triggered the nighmare by olcott the genious?
Do you still insist 0.999...∉[0,1)? LOL. This time, suggesting you are very
knowledgeable that "Determine n is even" not NPC needs proof...LOL again.
Please don't troll like crank. Say something nutrious or shut up.

To be on topic, can you show us the p (as mentioned) is NPC or p is not NPC,
either will do, to prove how much you understand what you talked about.