Groups | Search | Server Info | Login | Register
| Newsgroups | sci.logic |
|---|---|
| Date | 2023-06-18 13:54 -0700 |
| References | <e5d33e99-c842-4bb2-90ff-724b33a97707n@googlegroups.com> <7e5442c5-7f4f-44fe-b320-fc6483ccfd88n@googlegroups.com> <31aab6e4-2b74-4f34-8656-5e300bc93ed0n@googlegroups.com> <321bf189-0c08-493a-afdf-743a7dfc7f4cn@googlegroups.com> |
| Message-ID | <c610d44d-1479-413c-aebd-c30834db144dn@googlegroups.com> (permalink) |
| Subject | Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines |
| From | Daniel Pehoushek <pehoushek1@gmail.com> |
On Saturday, June 17, 2023 at 7:17:08 PM UTC-4, Daniel Pehoushek wrote: > On Saturday, June 17, 2023 at 2:49:28 AM UTC-4, Daniel Pehoushek wrote: > > 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+++ > the natural form of universal reason looks like the output from my program > where the input is in propositional conjunctive normal form > the output solves all quantified boolean formulas of that > otherwise called solving Pspace with Qspace > > the output of class allqbfs given all satisfying assignments in bitcodes is > an unquantified monotone conjunctive normal form over n variables > > every quantification of the input form is decided by plugging zero for universal and one for existential > > class allqbfs is 50 lines of 1000 and is my lifes work of over thirty years yet to be published > daniel2380+++ 30 years of essentially unpublished work by a 2380/2400 gre scorer on the satisfiability problem i solved the polynomial hierarchy for modest sizes by searching the whole space the final output is entirely monotone so avoid negation and be well daniel2380+++
Back to sci.logic | Previous | Next — Previous in thread | Next in thread | Find similar
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
Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines Rich D <rdelaney2001@gmail.com> - 2023-06-26 10:22 -0700
Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines Daniel Pehoushek <pehoushek1@gmail.com> - 2023-06-26 15:27 -0700
Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines Daniel Pehoushek <pehoushek1@gmail.com> - 2023-06-27 03:00 -0700
Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines Daniel Pehoushek <pehoushek1@gmail.com> - 2023-06-27 07:54 -0700
Re: NP Pspace #P #Q Qspace equality theory for modest sizes in 1000 lines Daniel Pehoushek <pehoushek1@gmail.com> - 2023-06-28 12:44 -0700
csiph-web