Article <875xuh51rv.fsf@bsb.me.uk>

Warning: mysqli::__construct(): (HY000/1203): User howardkn already has more than 'max_user_connections' active connections in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\includes\artfuncs.php on line 21
Failed to connect to MySQL: (1203) User howardkn already has more than 'max_user_connections' active connections
Warning: mysqli::query(): Couldn't fetch mysqli in D:\Inetpub\vhosts\howardknight.net\al.howardknight.net\index.php on line 66
Article <875xuh51rv.fsf@bsb.me.uk>

Deutsch English Français Italiano

<875xuh51rv.fsf@bsb.me.uk>

View for Bookmarking (what is this?)
Look up another Usenet article

Path: ...!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: Ben Bacarisse <ben@bsb.me.uk>
Newsgroups: comp.theory
Subject: Re: Is this =?utf-8?B?4oSZ4omg4oSV4oSZ?= proof 'humiliating'?
Date: Sun, 09 Jun 2024 20:55:48 +0100
Organization: A noiseless patient Spider
Lines: 16
Message-ID: <875xuh51rv.fsf@bsb.me.uk>
References: <e243777ead89baebc46eac4944e43adde8a9ddce.camel@gmail.com>
MIME-Version: 1.0
Content-Type: text/plain; charset=utf-8
Content-Transfer-Encoding: 8bit
Injection-Date: Sun, 09 Jun 2024 21:55:51 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="10cf193a09d8b28e96a65cf842abf907";
	logging-data="3952388"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1++nYhHg1ZAlTaurleVpzv0YzGCgorMNHQ="
User-Agent: Gnus/5.13 (Gnus v5.13)
Cancel-Lock: sha1:P80Cneyn8fMiIL3ftmJhkNkMCEY=
	sha1:kmZsMQtQa1usrDRO1ceyCWTTxMo=
X-BSB-Auth: 1.672396d6da43256ec4ad.20240609205548BST.875xuh51rv.fsf@bsb.me.uk
Bytes: 1772

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.

-- 
Ben.