Article <15c597b7393b57be4408e4e7d6948bb42245af95.camel@gmail.com>

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 <15c597b7393b57be4408e4e7d6948bb42245af95.camel@gmail.com>

Deutsch English Français Italiano

<15c597b7393b57be4408e4e7d6948bb42245af95.camel@gmail.com>

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

Path: ...!weretis.net!feeder8.news.weretis.net!eternal-september.org!feeder3.eternal-september.org!news.eternal-september.org!.POSTED!not-for-mail
From: wij <wyniijj5@gmail.com>
Newsgroups: comp.theory
Subject: Re: How to prove q is not NPC?
Date: Tue, 30 Jul 2024 21:30:56 +0800
Organization: A noiseless patient Spider
Lines: 18
Message-ID: <15c597b7393b57be4408e4e7d6948bb42245af95.camel@gmail.com>
References: <e6c84e13457b182991801bb2c50463354dff0b6b.camel@gmail.com>
	 <92bfb07b264dbfa64c9866e2243e8cd09de4909e.camel@gmail.com>
MIME-Version: 1.0
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Injection-Date: Tue, 30 Jul 2024 15:30:57 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="bc2446965c1a268f25118957b9eb4a17";
	logging-data="1114295"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX18sUzzqS0sAqPEgTmfuLUvP"
User-Agent: Evolution 3.50.2 (3.50.2-1.fc39)
Cancel-Lock: sha1:x3QOSdeoAb7mkN47lgCDTxEhCjU=
In-Reply-To: <92bfb07b264dbfa64c9866e2243e8cd09de4909e.camel@gmail.com>
Bytes: 1667

On Tue, 2024-07-30 at 20:29 +0800, wij wrote:
> On Mon, 2024-07-29 at 07:00 +0800, wij wrote:
> > Problem q: Given a number n, determine whether n is 5 or not.
> > What is the VALID proof that q=E2=88=89NPC?
> >=20
> > !!! This is a challenging question !!!
> >=20
>=20
> Let's change the question a bit.
>=20
> How do you prove q is not a NPC problem?
>=20

Or, How do  you prove the problem "determine whether n is 5" is not a NP-ha=
rd problem?

If these cannot be proven, what the computation theory is really doing?