Rocksolid Light

Welcome to novaBBS (click a section below)

mail  files  register  newsreader  groups  login

Message-ID:  

C++ is the best example of second-system effect since OS/360.

devel / comp.theory / Re: Check for errors my proof of P=NP

SubjectAuthor
* Check for errors my proof of P=NPVictor Porton
`* Check for errors my proof of P=NPDaniel Pehoushek
 `- Check for errors my proof of P=NPJeffrey Rubard

1
Check for errors my proof of P=NP

<007e1ed2-0f57-447d-bb5d-8571c7e576dfn@googlegroups.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=48812&group=comp.theory#48812

  copy link   Newsgroups: comp.theory
X-Received: by 2002:a05:622a:1805:b0:40f:2462:a356 with SMTP id t5-20020a05622a180500b0040f2462a356mr48105qtc.12.1692641078129;
Mon, 21 Aug 2023 11:04:38 -0700 (PDT)
X-Received: by 2002:a17:902:ecd1:b0:1bd:ca21:c64 with SMTP id
a17-20020a170902ecd100b001bdca210c64mr3278333plh.6.1692641077799; Mon, 21 Aug
2023 11:04:37 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!usenet.blueworldhosting.com!diablo1.usenet.blueworldhosting.com!peer03.iad!feed-me.highwinds-media.com!news.highwinds-media.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.theory
Date: Mon, 21 Aug 2023 11:04:37 -0700 (PDT)
Injection-Info: google-groups.googlegroups.com; posting-host=2a0d:6fc2:4043:b200:9f8f:8d3d:5904:4221;
posting-account=5t-ZfgkAAACU7ydoC4Cq-xVNAFsq481f
NNTP-Posting-Host: 2a0d:6fc2:4043:b200:9f8f:8d3d:5904:4221
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <007e1ed2-0f57-447d-bb5d-8571c7e576dfn@googlegroups.com>
Subject: Check for errors my proof of P=NP
From: porton.v...@gmail.com (Victor Porton)
Injection-Date: Mon, 21 Aug 2023 18:04:38 +0000
Content-Type: text/plain; charset="UTF-8"
X-Received-Bytes: 1438
 by: Victor Porton - Mon, 21 Aug 2023 18:04 UTC

Check for errors my proof of P=NP (without a practically efficient algorithm for an NP-complete problem):
https://drive.google.com/file/d/16Ws_eZF8f-rn1mFvkIT-UdMdvTwOu4vO/view?usp=drive_link
The proof is based on logic, namely Easton's theorem (and its consequence, incompleteness of ZFC), passing algorithms as arguments of algorithms, inverting bijections, reduction of SAT to another NP problem.

Re: Check for errors my proof of P=NP

<3359f96a-4467-45c4-92ae-d0df8f9daf76n@googlegroups.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=48857&group=comp.theory#48857

  copy link   Newsgroups: comp.theory
X-Received: by 2002:ad4:4d4a:0:b0:656:1d5f:f841 with SMTP id m10-20020ad44d4a000000b006561d5ff841mr33073qvm.10.1694698081490;
Thu, 14 Sep 2023 06:28:01 -0700 (PDT)
X-Received: by 2002:a05:6830:c0c:b0:6bc:6658:2d3f with SMTP id
bo12-20020a0568300c0c00b006bc66582d3fmr566135otb.1.1694698081290; Thu, 14 Sep
2023 06:28:01 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder8.news.weretis.net!proxad.net!feeder1-2.proxad.net!209.85.160.216.MISMATCH!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.theory
Date: Thu, 14 Sep 2023 06:28:00 -0700 (PDT)
In-Reply-To: <007e1ed2-0f57-447d-bb5d-8571c7e576dfn@googlegroups.com>
Injection-Info: google-groups.googlegroups.com; posting-host=2600:2b00:774c:5000:d141:40ef:bd11:ed2a;
posting-account=wr2KGQoAAADwR6kcaFpOhQvlGldc1Uke
NNTP-Posting-Host: 2600:2b00:774c:5000:d141:40ef:bd11:ed2a
References: <007e1ed2-0f57-447d-bb5d-8571c7e576dfn@googlegroups.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <3359f96a-4467-45c4-92ae-d0df8f9daf76n@googlegroups.com>
Subject: Re: Check for errors my proof of P=NP
From: pehoush...@gmail.com (Daniel Pehoushek)
Injection-Date: Thu, 14 Sep 2023 13:28:01 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
 by: Daniel Pehoushek - Thu, 14 Sep 2023 13:28 UTC

On Monday, August 21, 2023 at 2:04:39 PM UTC-4, Victor Porton wrote:
> Check for errors my proof of P=NP (without a practically efficient algorithm for an NP-complete problem):
> https://drive.google.com/file/d/16Ws_eZF8f-rn1mFvkIT-UdMdvTwOu4vO/view?usp=drive_link
> The proof is based on logic, namely Easton's theorem (and its consequence, incompleteness of ZFC), passing algorithms as arguments of algorithms, inverting bijections, reduction of SAT to another NP problem.

from the paper:
Our machine will be with infinite random access memory and infinite word size.

that machine may be very enough powerful to prove many assertions rapidly.
daniel2380+++

Re: Check for errors my proof of P=NP

<b787d76a-9db4-4207-8921-e33546e690f7n@googlegroups.com>

  copy mid

https://www.novabbs.com/devel/article-flat.php?id=48863&group=comp.theory#48863

  copy link   Newsgroups: comp.theory
X-Received: by 2002:a05:620a:141:b0:774:f02:7e59 with SMTP id e1-20020a05620a014100b007740f027e59mr1986qkn.11.1695405903733;
Fri, 22 Sep 2023 11:05:03 -0700 (PDT)
X-Received: by 2002:a05:6808:188d:b0:3a9:8394:1625 with SMTP id
bi13-20020a056808188d00b003a983941625mr212848oib.9.1695405903236; Fri, 22 Sep
2023 11:05:03 -0700 (PDT)
Path: i2pn2.org!i2pn.org!weretis.net!feeder6.news.weretis.net!border-2.nntp.ord.giganews.com!nntp.giganews.com!news-out.google.com!nntp.google.com!postnews.google.com!google-groups.googlegroups.com!not-for-mail
Newsgroups: comp.theory
Date: Fri, 22 Sep 2023 11:05:03 -0700 (PDT)
In-Reply-To: <3359f96a-4467-45c4-92ae-d0df8f9daf76n@googlegroups.com>
Injection-Info: google-groups.googlegroups.com; posting-host=198.236.192.210; posting-account=0pheVgoAAACKj674Kl3qdRoiYysIz_ok
NNTP-Posting-Host: 198.236.192.210
References: <007e1ed2-0f57-447d-bb5d-8571c7e576dfn@googlegroups.com> <3359f96a-4467-45c4-92ae-d0df8f9daf76n@googlegroups.com>
User-Agent: G2/1.0
MIME-Version: 1.0
Message-ID: <b787d76a-9db4-4207-8921-e33546e690f7n@googlegroups.com>
Subject: Re: Check for errors my proof of P=NP
From: jeffreyd...@gmail.com (Jeffrey Rubard)
Injection-Date: Fri, 22 Sep 2023 18:05:03 +0000
Content-Type: text/plain; charset="UTF-8"
Content-Transfer-Encoding: quoted-printable
Lines: 19
 by: Jeffrey Rubard - Fri, 22 Sep 2023 18:05 UTC

On Thursday, September 14, 2023 at 6:28:03 AM UTC-7, Daniel Pehoushek wrote:
> On Monday, August 21, 2023 at 2:04:39 PM UTC-4, Victor Porton wrote:
> > Check for errors my proof of P=NP (without a practically efficient algorithm for an NP-complete problem):
> > https://drive.google.com/file/d/16Ws_eZF8f-rn1mFvkIT-UdMdvTwOu4vO/view?usp=drive_link
> > The proof is based on logic, namely Easton's theorem (and its consequence, incompleteness of ZFC), passing algorithms as arguments of algorithms, inverting bijections, reduction of SAT to another NP problem.
> from the paper:
> Our machine will be with infinite random access memory and infinite word size.
>
> that machine may be very enough powerful to prove many assertions rapidly..
> daniel2380+++

"Clap, clap, clap".

1
server_pubkey.txt

rocksolid light 0.9.81
clearnet tor