> Maymin failed in his effort to place a specific NP-complete problem 3SAT in P by not constructing polynomial-time algorithm. What does that prove? >
I am afraid, not much regarding P =? NP, since as you noted earlier, his "Programming the Market" scheme is a Market Machine in the sense of a second-rate Oracle Machine where instead of a Turing Machine connected to a Turing Oracle one has presumably a computer connected to a Market via a suitable broker platform. For instance, assuming just for the sake of the argument, that an actual Market Machine (according to his scheme) were able to solve any 3-SAT problems still would not necessarily imply P = NP because it is far from clear that the behavior of such a market would even be Turing computable. Of course, in la-la land, we could just assume that the behavior of such market is Turing computable in P and be done with that. ;) (Yes Donna, I know, yours was a rhetorical question.) On Wed, Sep 11, 2019 at 12:16 PM Donna Y <dy...@sympatico.ca> wrote: > > Maymin failed in his effort to place a specific NP-complete problem 3SAT in P by not constructing polynomial-time algorithm. What does that prove? > > Donna Y > dy...@sympatico.ca > > > > On Sep 11, 2019, at 11:15 AM, Raul Miller <rauldmil...@gmail.com> wrote: > > > > On Tue, Sep 10, 2019 at 7:53 PM Jose Mario Quintana > > <jose.mario.quint...@gmail.com> wrote: > >> Raul wrote, > >>> Significant SAT-3 problems involve more than clause. > >> > >> What happened? According to your favorite paper, > > > > Somehow what I posted was not what I intended to say. > > > > I intended to say: > > > > "Significant SAT-3 problems involve more than one clause." > > > > By leaving out the word *one*, I left my sentence open to an > > interpretation which had little or nothing to do with my intended > > meaning. (Sorry about that.) > > > > ((Honestly, though, I am surprised that you were not already aware of > > this aspect of SAT-3. How could SAT-3 have an equivalence to SAT-n > > without multiple clauses?)) > > > > Anyways, hopefully, this time I am posting what I intend to say... > > > > Thanks, > > > > -- > > Raul > > ---------------------------------------------------------------------- > > For information about J forums see http://www.jsoftware.com/forums.htm > > ---------------------------------------------------------------------- > For information about J forums see http://www.jsoftware.com/forums.htm ---------------------------------------------------------------------- For information about J forums see http://www.jsoftware.com/forums.htm
