-5
$\begingroup$

do all logicians on earth know that a question is a qbf? yes
and they know the answer to a qbf is always yes or no? yes
ok good
all logicians know that solving one qbf is hard and buggy? yes
but solving all qbfs from all models is a linear transformation? yes
ok good
so from a dnf of all models comes a dnf of all qbfs? yes
what if i want a cnf from the dnf? trivial but quadratic
is qbf exponential? well, P!=NP for large dimensions, so, yes
so for true satisfiability one must know all models? yes, #P=NP
and from 2002 #P=#Q? yes
everybody knows? yes
so the conclusion that #Q=NP seems like two inferences to some logicians? yes
i don't believe that at all. well, you are stupid. no, i am smart.
the number of valid quantifications problem is in theory
as hard in general as finding one model? yes
so NP=QSPACE? yes
joseph daniel pehoushek gres 2380 sats 1530

$\endgroup$
8
  • 2
    $\begingroup$ What? I don't understand what you are asking here. Please be clear on what you want to be answered. $\endgroup$
    – nir shahar
    Oct 13 at 20:32
  • $\begingroup$ program bob can solve all qbfs when #P < 4,000,000? yes, perfectly. $\endgroup$ Oct 13 at 20:38
  • 2
    $\begingroup$ Excuse me, but I can't understand at all what you are asking. This is a Questions-and-Answers site: please state your question clearly. $\endgroup$
    – nir shahar
    Oct 13 at 20:41
  • 1
    $\begingroup$ Then why ask here? What is the point of asking and answering yourself inside the question? $\endgroup$
    – nir shahar
    Oct 13 at 20:44
  • 1
    $\begingroup$ Also, your "proof" that $\#P=NP$ doesn't make sense. If you want to prove something, start by writing a formal mathematical argument - not intuition (intuition can be really misleading sometimes, especially with $P=NP$ or $P\neq NP$ type of "proof attempts") $\endgroup$
    – nir shahar
    Oct 13 at 21:01