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 22:58:32 +0800
Organization: A noiseless patient Spider
Lines: 29
Message-ID: <1e25b8164da4bb351086d42f4a9479b2195b28f8.camel@gmail.com>
References: <e6c84e13457b182991801bb2c50463354dff0b6b.camel@gmail.com>
	 <92bfb07b264dbfa64c9866e2243e8cd09de4909e.camel@gmail.com>
	 <15c597b7393b57be4408e4e7d6948bb42245af95.camel@gmail.com>
	 <v8ar7k$utn9$1@dont-email.me>
MIME-Version: 1.0
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Injection-Date: Tue, 30 Jul 2024 16:58:33 +0200 (CEST)
Injection-Info: dont-email.me; posting-host="bc2446965c1a268f25118957b9eb4a17";
	logging-data="1132872"; mail-complaints-to="abuse@eternal-september.org";	posting-account="U2FsdGVkX1/WNaH8A70jf3lI/N7T3tHl"
User-Agent: Evolution 3.50.2 (3.50.2-1.fc39)
Cancel-Lock: sha1:3czbQxz7fm6Y1qav3soZUkqaa+U=
In-Reply-To: <v8ar7k$utn9$1@dont-email.me>
Bytes: 2351

On Tue, 2024-07-30 at 14:52 +0100, Andy Walker wrote:
> On 30/07/2024 14:30, wij wrote:
> > On Tue, 2024-07-30 at 20:29 +0800, wij wrote: [...]
> > > On Mon, 2024-07-29 at 07:00 +0800, wij wrote: [...]
> > Or, How do=C2=A0 you prove the problem "determine whether n is 5" is no=
t> a NP-hard problem?
> > If these cannot be proven, what the computation theory is really doing?
>=20
> 	Did you not understand the answers you have previously had from
> Ben and me, and possibly others I've forgotten [sorry if so]?=C2=A0 Categ=
ories
> such as NPC, NP-hard, ... are "interesting" only if P /=3D NP.=C2=A0 If y=
ou can
> prove /that/, then don't waste time here, fame and fortune await.
>=20

No, I don't remember Ben said anything interesting. And I don't remember an=
ything
you had posted about this. Anyway, I like your on-topic answer.
I just realized the current complexity theory cannot even tell "1=3D2" is N=
PC (or NP-hard) or not.

Don't think I am all about this question. I had already read about 20 books=
 (about=C2=A0
software, AI, math.) in the past two months. You keep on dreaming on your "=
surreal" garbage.