Hi Vlad and all, ... Vlad I would like you to check that against Boolos and Jeffrey's Computability and Logic, chapter 10. There they prove that arbitrary TM, ...
1125
Barthez UK
barthez_uk@...
May 2, 2000 12:46 am
Please unsubscribe me ... ________________________________________________________________________ Get Your Private, Free E-mail from MSN Hotmail at...
1126
Vladimir Z. Nuri
vznuri@...
May 2, 2000 11:53 pm
please do NOT send unsubscribe requests to the list or to me. neither will be handled. this is considered one of the basics of "netiquette" in cyberspace. if...
1127
Zenith Erich Vivas Ca...
zvivas@...
May 3, 2000 11:50 am
I'm sorry Mr. Nuri, but I didn't understand you at all. Are you requesting me to unsuscribe? Thanks Z. Vivas ... please do NOT send unsubscribe requests to the...
1128
Vladimir Z. Nuri
vznuri@...
May 3, 2000 5:21 pm
just an update for anyone who is interested.. thanks for everyone's comments on my problems (1) and (2).. it was a great reality check. after looking over some...
1129
Barthez UK
barthez_uk@...
May 4, 2000 12:14 am
netiquette - you've got to be joking ... ________________________________________________________________________ Get Your Private, Free E-mail from MSN...
1130
Klaus D. Witzel
kwitzel@...
May 4, 2000 8:26 am
I kindly ask you all to immediately stop distributing opinions, questions, critique and the like, about "unsubscribe", "netiquette" and other completely...
1131
Frieder Stolzenburg
stolzen@...
May 4, 2000 1:58 pm
Hi all, it is well-known that there are 2^(2^n) non-equivalent formulae with (at most) n atoms occurring in it in propositional logic, i.e. double-exponential...
Let me give "limits" it a try, albeit only an idea from [perhaps] another perspective, by dicussing my method of analysing "hard" TMs. Claim: Every TM whose...
1134
superryan@...
May 7, 2000 4:21 pm
In a message dated 5/5/2000 6:41:39 am Eastern Daylight Time, ... in ... Precisely what do you mean by "matched"? I can't follow the rest of this without that...
1135
superryan@...
May 7, 2000 5:02 pm
To represent an arbitrary "Horn atom" of n variables (an atom that is Horn, that is, it has at most one positive literal), there are n+1 possibilities for any...
1136
Frieder Stolzenburg
stolzen@...
May 8, 2000 8:35 am
... Well, what you computed is approximately the number of different clauses that can occur in a Horn formula. If we assume that there are n propositional...
1137
Klaus D. Witzel
kwitzel@...
May 8, 2000 9:12 am
... run ... of ... Thank you superryan. I also found another point: cancel "in polynominal time" and set "a finite amount of steps", fingers where too fast and...
1138
superryan@...
May 8, 2000 1:52 pm
In a message dated 5/8/2000 4:35:41 am Eastern Daylight Time, ... Actually, I was just computing the number of Horn formulas where all of the clauses have n...
1139
Mati Tombak
mati@...
May 24, 2000 10:38 am
Hi, Our student Oleg Myrk has proved an interesting generalization of Dan Pehousek's #Q=#P theorem. Instead of Boolean functions he is considering predicates...
1140
Vladimir Z. Nuri
vznuri@...
May 24, 2000 8:31 pm
From: "senko" <senko@...> Subject: Quantum Computer Simulator Ver. 1.2 Date: Tue, 23 May 2000 16:23:50 +0900 To: "QC E-mail List Overseas"...
1141
Vladimir Z. Nuri
vznuri@...
May 26, 2000 7:09 am
this came from another mailing list, fwded by a friend.. have not hit the links yet. what does everyone think of this? very exciting in my opinion. ...
1142
Klaus D. Witzel
kwitzel@...
May 26, 2000 7:28 am
Interesting. Can you forward the following to Oleg: What version / variant / spec of the Pehousek Theorem #Q=#P did he use, reference? Did he consider only...
1143
Stas Busygin
busygin@...
May 26, 2000 4:30 pm
Hello, Does anybody know is there a good algorithmic implementation of graph preprocessing for different hard graph problems? For instance, if we are solving...
1144
Dan Pehoushek
danpehous@...
May 26, 2000 5:15 pm
That's wonderful, Mati. It looks like a good generalization. I look forward to seeing more about the result! It's a rich topic. ... ...
1145
Vladimir Z. Nuri
vznuri@...
May 26, 2000 9:56 pm
hi everyone.. congratulations to Dan on spawning a miniresearch program!! when I was younger I used to think it would be easy to get other people interested in...
1146
Vladimir Z. Nuri
vznuri@...
May 26, 2000 10:00 pm
hi Stas.. in my opinion the best general methods for preprocessing graphs are the techniques used for simplifying SAT problems. a wide variety of techniques...
1147
superryan@...
May 27, 2000 5:14 am
A while back I wrote up a little paper which defined a new counting class that used PSPACE problems, gave motivation for why its problems should be hard to...
1148
Stas Busygin
busygin@...
May 27, 2000 3:24 pm
Hi, Vladimir and others, ... The matter is that the simplifying rules I was talking about can't be explained directly as rules on contradictions -- they are...
1149
Oleg Mürk
olegm@...
May 30, 2000 7:21 am
... As the matter of fact, I'm quite far away from this discipline. It was an occasional result, that was proven out of curiosity. So I'm afraid that I can't...
1150
Mati Tombak
mati@...
May 31, 2000 12:54 pm
... Hi, I tried to restore the history of #P == #Q: Comp.sci: July 1997 - Dan Pehousek's hypothesis #P == #Q, supported by computer experiments Comp.sci: July...
1151
Dan Pehoushek
danpehous@...
Jun 8, 2000 6:52 pm
As far as being "miniresearch", I suppose time will tell. While not the same as FLT, it does have some interest accruing. But, you are correct about it being...
1152
Dan Pehoushek
danpehous@...
Jun 8, 2000 6:53 pm
As far as being "miniresearch", I suppose time will tell. While not the same as FLT, it does have some interest accruing. But, you are correct about it being...
1153
Jeffrey Considine
jconsidi@...
Jun 8, 2000 7:01 pm
... I'm glad to hear it was useful! I take it the shortest flowset approach you mention below works as a good splitting heuristic? ... If I recall correctly,...
