Sujet : Is this ℙ≠ℕℙ proof 'humiliating'?
De : wyniijj5 (at) *nospam* gmail.com (wij)
Groupes : comp.theoryDate : 08. Jun 2024, 15:11:07
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <e243777ead89baebc46eac4944e43adde8a9ddce.camel@gmail.com>
User-Agent : Evolution 3.50.2 (3.50.2-1.fc39)
ℙ≠ℕℙ 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.
…