... ... Your conjecture is True. Roughly, the property you are describing is called "tree-width". I believe it has been mentioned before on this list. The...
877
Vladimir Z. Nuri
vznuri@...
Aug 16, 1999 6:03 am
hi everyone. I was in los angeles this week for a quasi-job interview, and also to attend SIGGRAPH (www.siggraph.org) for two days.. as I write this I am near...
878
Vladimir Z. Nuri
vznuri@...
Aug 18, 1999 7:09 pm
hi everyone. I was in los angeles this week for a quasi-job interview, and also to attend SIGGRAPH (www.siggraph.org) for two days.. as I write this I am near...
879
Vladimir Z. Nuri
vznuri@...
Aug 18, 1999 7:10 pm
... hi dan. thanks for the tip & consideration. I guess the next question is, where is/should research into tree width go. do you mind stating.. what is the...
880
d p
danpeh@...
Aug 22, 1999 9:39 pm
Well, I can't claim to be an expert on the topic anymore, because I haven't studied it for years. I do recommend some papers by Hans Bodlaender...
881
info@...
Aug 23, 1999 5:20 pm
... common. a close graph concerning dependence of variables is discussed in: E.Ya.Dantsin "Algorithmic of Propositional Satisfiability Problems",...
882
u5ty@...
Aug 23, 1999 11:28 pm
1-888-638-7718 Code 948 FINALLY AN EASY WAY TO MAKE MONEY AND HELP OTHERS WHO HAVE: BAD CREDIT NO CREDIT BANKRUPCY FIND OUT HOW YOU...
883
Vladimir Z. Nuri
vznuri@...
Aug 24, 1999 3:34 am
hi Dan.. I printed out your post today and read it. a few questions: 1. in your post, are E3 edges of the original graph. I assume so. 2. there are obviously...
884
d p
danpeh@...
Aug 24, 1999 7:20 pm
... Yes: E = E1 union E2 union E3; with no intersection among E1, E2, and E3. ... Having a decomposition of a graph with minimal tree-width would be...
885
d p
danpeh@...
Aug 24, 1999 7:35 pm
... A translation of the above idea into C++ is also available. The orb and twiddle source codes have a reasonably effective implementation of "component ...
886
Vladimir Z. Nuri
vznuri@...
Aug 24, 1999 10:51 pm
hi everyone. for several weeks I've been hinting about sharing some TM-related research. for about the past 3 months I have been working on this problem and ...
887
adall@...
Aug 25, 1999 6:12 pm
Hmm.. from what you propose Vladimir, it seems to me very familiar with Alan Turing's work on a method to overcome the limitations imposed by Godel's theorem....
888
Vladimir Z. Nuri
vznuri@...
Aug 26, 1999 7:14 pm
hi AD.. thanks for the feedback. yes I will continue to clarify over the next few posts. yes, Turings paper about repeatedly augmenting the axiomatic system ...
889
Vladimir Z. Nuri
vznuri@...
Aug 26, 1999 7:14 pm
this is the second post in my series examining my recent TM related research. the goal at hand is to create a basic TM compiler. for convenience, I have...
890
Vladimir Z. Nuri
vznuri@...
Aug 26, 1999 8:05 pm
hi everyone. we now have about 209 subscribers. I'd like to invite any new members to introduce yourself to the list. we're interested in where you have gone ...
891
Peter Hines
max003@...
Aug 27, 1999 2:39 pm
... Just to add a few comments of my own about Vlad's research program: Firstly, the correspondence between proofs (in natural deduction), and programs (in...
892
Vladimir Z. Nuri
vznuri@...
Aug 27, 1999 6:50 pm
hi Peter, thanks for the note.. lambda calculus, as you say equivalent to TMs, has a lot of nice theoretical properties and has probably been studied from more...
893
adall@...
Aug 27, 1999 10:06 pm
Hi Vladimir, from what I'm seeing in your posts, the TM framework you have defined and even your compiler are creating SMC or RAM like machines... Basically,...
895
Vladimir Z. Nuri
vznuri@...
Aug 27, 1999 6:57 pm
this is the third post in my series examining my recent TM related research. here is a very simple test program that demonstrates the TM compiler. 1 2 ; 3 ;...
896
Vladimir Z. Nuri
vznuri@...
Aug 28, 1999 12:53 am
hi AD.. ... I think I'm familiar with RAM machines.. the idea is they have an addressable memory on the tape, right..? as for SMC I am not familiar with...
897
Vladimir Z. Nuri
vznuri@...
Aug 28, 1999 5:43 pm
this is the fourth post in my series examining my recent TM related research. in the last few posts we looked at a simple TM compiler and program. the program...
898
Vladimir Z. Nuri
vznuri@...
Aug 30, 1999 6:07 am
this is the fifth post in my series examining my recent TM related research. as part of my halting-detection system I have described earlier, the TM is...
899
Vladimir Z. Nuri
vznuri@...
Aug 31, 1999 3:59 am
this is the sixth post in my series examining my recent TM related research. let us consider a very simple TM that obviously does not halt: 1 2 ; 3 ; test prog...
900
d p
danpeh@...
Aug 31, 1999 4:27 pm
Please forgive me for picking a nit about TM research. ... NIT: Using what compiler on what machine? ... May I point out that, with bounded arithmetic (i.e....
901
Vladimir Z. Nuri
vznuri@...
Aug 31, 1999 10:11 pm
hi dan.. sure go ahead and pick nits. I suppose picking a nit is better than no response at all. ... in the previous posts I described the compiler. its a few...
902
Vladimir Z. Nuri
vznuri@...
Aug 31, 1999 10:12 pm
this is the seventh post in my series examining my recent TM related research. earlier I proposed the problem of creating a TM that verifies the commutative...
903
Vladimir Z. Nuri
vznuri@...
Sep 1, 1999 7:19 pm
this is the eighth post in my series examining my recent TM related research. I showed how I created a macro system that allowed me to express the a+b == b+a...
904
Vladimir Z. Nuri
vznuri@...
Sep 3, 1999 7:35 am
this is the ninth post in my series examining my recent TM related research. this is an abbreviated simulation file of the a+b == b+a TM, showing every...
905
Mati Tombak
mati@...
Sep 3, 1999 8:53 am
Hi, I was on my vacation and could not react to benchmarks postings. Dan, you were fantastically quick and the Q-expression for Dedekind is very interesting. ...
906
d p
danpeh@...
Sep 4, 1999 12:57 am
... Great! I believe that "counting" the solutions to boolean expressions is, in general, as hard as the hardest satisfiabiliy problems. That is, if counting...
