Greetings all! Regarding PC's: I would love to learn how to do my own programming on my PC (IBM compatible 486). I am of the age (66) where I passed my...
158
Iraj Kalantari
Iraj_Kalantari@...
Oct 1, 1998 1:52 pm
Please unsubscribe. This is not my area of study. Thank you. ______________________________________________________________________ Subscribe, unsubscribe,...
159
XDuchess@...
Oct 1, 1998 10:22 pm
Same here, unsubscribe my punk ass. ______________________________________________________________________ Subscribe, unsubscribe, opt for a daily digest, or...
160
Vladimir Z. Nuri
vznuri@...
Oct 1, 1998 10:47 pm
to unsubscribe, send email to theory-edge-unsubscribe@egroups.com ______________________________________________________________________ Subscribe,...
161
Vladimir Z. Nuri
vznuri@...
Oct 1, 1998 11:49 pm
hi conrad-- programming is not hard to learn. how long have you had your computer? if you can navigate things like a word processor and/or a spreadsheet,...
162
Vladimir Z. Nuri
vznuri@...
Oct 2, 1998 12:42 am
he reduces the Riemann conjecture to "the validity of the trace formula". what's that, anyone know? ... From: fiedorow@... (Zbigniew...
163
Joe Rongen
joerongen@...
Oct 2, 1998 3:15 am
... Here are some easy to use (I can only speak for Win95/98) ...complete packages. These packages can be obtained for free and are available on the www. I...
164
Claude
claude@...
Oct 2, 1998 6:11 am
Hi! Here is an introduction to it, a question, and a generalisation. Consider P = (a OR b OR c) AND (NON a OR d OR e) where the variables are either False or...
165
Nico Benschop
benschop@...
Oct 2, 1998 9:25 am
Maybe an interesting BF representation for some purposes ? This is how I analyse BF structure, as a network of SymBF's, coupled by inverters, for Logic...
166
JDPeh@...
Oct 2, 1998 7:22 pm
Thanks Claude! ... You got it! And it turns out, constructing QP from 2-cnfs (P consists of a conjunction of size 2 disjunctions) is easy. First, use...
167
SuperRyan@...
Oct 4, 1998 12:54 am
In a message dated 98-09-30 07:40:58 EDT, you write: << for example, I am always somewhat interested in university politics relative to various subjects. some...
168
Jeffrey Considine
jconsidi@...
Oct 4, 1998 2:21 am
... I am an undergrad/grad student (combined program) at Boston University and we are having similar changes here. We still have Levin and other theory people ...
169
peter hines
max003@...
Oct 4, 1998 10:34 am
On Thu, 01 Oct 1998 08:18:00 +0100 Nico Benschop ... Personally, I would have thought that quite usual behaviour for academics (maybe you should have just done...
170
Nico Benschop
benschop@...
Oct 4, 1998 1:19 pm
... ^^^^^^^^^^^^^^^^^^ Yes, if finite: they are a lattice ordered union of group (if I'm not mistaken). Each element x in such inverse semigrp S(.) is what I...
... odd #'s > 5 may be expressed as the sum of three primes. Sorry I didn't explain that. Thanks for your help! CFE ... ...
173
Claude
claude@...
Oct 4, 1998 7:34 pm
... Yes, but it's better than that! See the technical elaborations I am now posting in comp.theory. ... Now this is an misstatement of mine. More exactly: ...
174
Vladimir Z. Nuri
vznuri@...
Oct 5, 1998 12:54 am
well, we have the beginnings of our first thread!!<g> when I mentioned "sexy" subjects earlier, here's what I mentioned: DNA computing quantum computing to me,...
175
Nico Benschop
benschop@...
Oct 5, 1998 6:44 am
... Claude Shannon in 1938 (his MSc thesis at MIT) noticed the isomorphism between Boolean Algebra (1854: "The Laws of Thought", Dover publication pocket...
176
Nico Benschop
benschop@...
Oct 5, 1998 9:45 am
... ... and Logic Circuits (in his case: relay networks). Boole had another application for his "logic arithmetic": checking the God_existence proofs of...
177
peter hines
max003@...
Oct 5, 1998 11:35 am
Hi, Nico, On Sat, 26 Sep 1998 22:21:42 +0100 Nico Benschop ... The mention of a group was just drawing an analogy - as you say, the computational...
178
Martyn Amos
martyn@...
Oct 5, 1998 2:59 pm
... Perhaps you may be interested in a combination of DNA computing and Boolean circuits... http://www.csc.liv.ac.uk/~ctag/archive/t/CTAG-97009.ps (Sorry for...
179
JDPeh@...
Oct 5, 1998 3:13 pm
... Glad for the interest! I'll post a few review articles soon, a summary of some ideas that need work, and we'll see where it goes. As for etiquette, I...
180
JDPeh@...
Oct 5, 1998 4:46 pm
... Great! ... Great again! ... The suggestion is for a discussion group where some researchers could freely share ideas, programming techniques and tips,...
181
Vladimir Z. Nuri
vznuri@...
Oct 6, 1998 12:31 am
one possibility is just a simple mention of theory-edge as a mailing list that discusses SAT among other issues on the JAR SAT issue web site, so that...
182
JDPeh@...
Oct 7, 1998 2:35 am
... I'm sure it does quite well. I've played with it a little and gotten some very good results. For more extensive work along those lines, I suggest ...
183
Vladimir Z. Nuri
vznuri@...
Oct 8, 1998 1:36 am
regarding GSAT, I was thinking recently that there might be a way to leverage davis/putnam off of GSAT. the GSAT would satisfy most of the clauses, and then...
184
JDPeh@...
Oct 8, 1998 11:55 pm
... My idea about converting davis-putnam, that worked out pretty well, was as follows: [ Davis_Putnam( current_branch ) Poly_work to pick a var, and maybe do...
185
Ian Philip Gent
ipg@...
Oct 9, 1998 1:50 pm
I'm ashamed to say that we haven't had a web page for SAT 2000 yet. I've just set one up but to date it is just the text of the call for papers. ...
186
Vladimir Z. Nuri
vznuri@...
Oct 10, 1998 12:25 am
here's another interesting idea for SAT I got after I wrote the last msg. the current davis-putnam algorithm does not decide which truth value to set a new...
