| Deutsch English Français Italiano |
|
<d1a5a20f177a420656593988ee9beca9@www.rocksolidbbs.com> View for Bookmarking (what is this?) Look up another Usenet article |
Path: ...!weretis.net!feeder9.news.weretis.net!i2pn.org!i2pn2.org!.POSTED!not-for-mail From: nnymous109@gmail.com (nnymous109) Newsgroups: comp.theory Subject: Re: Yet another contribution to the P-NP question Date: Sun, 29 Sep 2024 17:43:38 +0000 Organization: RetroBBS Message-ID: <d1a5a20f177a420656593988ee9beca9@www.rocksolidbbs.com> References: <85955d539da522cf777ab489101c0e2a@www.rocksolidbbs.com> <4b415dd5a91ac648bee8224fc3c28aa19706e06f.camel@gmail.com> <a4cacd3261a32cb9a769fbfe6ed1cd15@www.rocksolidbbs.com> <87cykqgfax.fsf@bsb.me.uk> <MWqdnZDONIeEjWv7nZ2dnZfqnPudnZ2d@brightview.co.uk> <877cawhg6g.fsf@bsb.me.uk> <793e0d649cf836d3b0bbdf9c1f946091@www.rocksolidbbs.com> <87v7yffh5h.fsf@bsb.me.uk> <3f36b24ff7a1d155688df8517ffc4032@www.rocksolidbbs.com> MIME-Version: 1.0 Content-Type: text/plain; charset=utf-8; format=flowed Content-Transfer-Encoding: 8bit Injection-Info: i2pn2.org; logging-data="4034864"; mail-complaints-to="usenet@i2pn2.org"; posting-account="rrhMWBcDAx1rC5+om1CWMH+W6SvwsR4AkzPL9w80GDY"; User-Agent: Rocksolid Light X-Rslight-Posting-User: 997a80a59f36bca0d6daf54c90c3284ff767f4d5 X-Spam-Checker-Version: SpamAssassin 4.0.0 X-Rslight-Site: $2y$10$kzwzBzBJz8bXfduSHpe2cu.fzjt2l5tyuEBls1MlECIUup6N8cqDa Bytes: 2248 Lines: 16 > With the assertion** that any recursion that decides that a computation > satisfies some property necessarily yields at least one element of the > computation***, I am suggesting that it is easier to check for inclusion > in this set that it is to check for exclusion. > I would call the proof strategy I have come up with an "examine all the > cases" type proof except the underlying observation as to why we must do > that is that if x1 and x2 are different strings, unless there is some > extra information we have been given beforehand (about x1 and x2) that > we can take advantage of, there is in general no correspondence between > S.(M(x1)) and S.(M(x2)). Yet another way of expressing the same thing is that to decide L_P 'efficiently', we cannot consider the 'x's independently. But, in general, to know that we need not consider some x1 and x2 independently, we'd have to consider them independently after all.