Groups | Search | Server Info | Login | Register

Groups > sci.logic > #254458

Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines

Show all headers | View raw

On Friday, June 16, 2023 at 11:28:55 AM UTC-4, Daniel Pehoushek wrote:
> On Monday, June 5, 2023 at 6:32:26 PM UTC-4, Daniel Pehoushek wrote: 
> > the other most recent thread titled 
> > with wisdom is both monotone and conjunctive 
> > discusses the 50 lines of class allqbfs 
> > for transforming from pspace in disjunctive normal form 
> > into qspace first in dnf (linear space time) then cnf (quadratic time) 
> > 
> > the code is correct for all sizes but succeeds on modest sizes 
> > such as c3d5n240 three coloring fifth degree 240 vertices 
> > 
> > the 1000 line program prints out 
> > a monotone conjunctive normal form that 
> > decides all 2^n possible quantifications 
> > one conjunction of brief monotone disjunctions describes wisdom 
> > 
> > i posit those transforms are high level mind 
> > the equality of np with #p and pspace and #q and qspace 
> > is supportive of the "mind equations" idea 
> > 
> > i have studied satisfiability for thirty years after 
> > in 1997 discovering #p=#q 
> > the number of satisfying assignments equals 
> > the number of valid quantifications in 1997 (knuth volume four) 
> > 
> > avoid negation and be a good leader 
> > daniel2380+++ 
> > the 2380 is out of 2400 on the 1983 gres graduate records examination
> so NP=Pspace=#P=#Q=Qspace and for modest sizes formulas are solvable. 
> That is, #P=Exp but is P for modest size. 
> 
> The output of my program is a monotone cnf that decides every quantification. 
> The program is as good as it gets. 
> 
> One major discovery is that clause learning is wrong for #P and therefore also wrong for NP. 
> avoid negation and be well 
> daniel2380+++
the big equality derives from searching the whole space of possibility.
for modest sizes the whole space is solvable, so that
for qspace, production of a monotone form that
decides all 2^n quantifications is possible.

is this topic appropriate for sci.logic?
the solution of the boolean hierarchy?

be well and avoid negation
daniel2380+++

Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar

Thread

NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines Daniel Pehoushek <pehoushek1@gmail.com> - 2023-06-05 15:32 -0700
  Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines Daniel Pehoushek <pehoushek1@gmail.com> - 2023-06-16 08:28 -0700
    Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines Daniel Pehoushek <pehoushek1@gmail.com> - 2023-06-16 23:49 -0700
      Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines Daniel Pehoushek <pehoushek1@gmail.com> - 2023-06-17 16:17 -0700
        Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines Daniel Pehoushek <pehoushek1@gmail.com> - 2023-06-18 13:54 -0700
          Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines Daniel Pehoushek <pehoushek1@gmail.com> - 2023-06-21 15:11 -0700
      Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines Rich D <rdelaney2001@gmail.com> - 2023-06-22 14:38 -0700
        Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines Daniel Pehoushek <pehoushek1@gmail.com> - 2023-06-22 15:25 -0700
          Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines Rich D <rdelaney2001@gmail.com> - 2023-06-24 13:04 -0700
            Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines Daniel Pehoushek <pehoushek1@gmail.com> - 2023-06-24 14:14 -0700

csiph-web