Sujet : Re: How to prove q is not NPC?
De : wyniijj5 (at) *nospam* gmail.com (wij)
Groupes : comp.theoryDate : 30. Jul 2024, 16:58:32
Autres entêtes
Organisation : A noiseless patient Spider
Message-ID : <1e25b8164da4bb351086d42f4a9479b2195b28f8.camel@gmail.com>
References : 1 2 3 4
User-Agent : Evolution 3.50.2 (3.50.2-1.fc39)
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 you prove the problem "determine whether n is 5" is not> a NP-hard problem?
If these cannot be proven, what the computation theory is really doing?
Did you not understand the answers you have previously had from
Ben and me, and possibly others I've forgotten [sorry if so]? Categories
such as NPC, NP-hard, ... are "interesting" only if P /= NP. If you can
prove /that/, then don't waste time here, fame and fortune await.
No, I don't remember Ben said anything interesting. And I don't remember anything
you had posted about this. Anyway, I like your on-topic answer.
I just realized the current complexity theory cannot even tell "1=2" is NPC (or NP-hard) or not.
Don't think I am all about this question. I had already read about 20 books (about
software, AI, math.) in the past two months. You keep on dreaming on your "surreal" garbage.
How to prove q is not NPC?
Re: How to prove q is not NPC?
