Re: John Bokma harassment

2006-05-24 Thread Geoffrey Summerhayes
"Bill Atkins" <[EMAIL PROTECTED]> wrote in message news:[EMAIL PROTECTED] > John Bokma <[EMAIL PROTECTED]> writes: > > [snip] > >> -- >> John MexIT: http://johnbokma.com/mexit/ >>personal page: http://johnbokma.com/ >> Exper

Re: John Bokma harassment

2006-05-25 Thread Geoffrey Summerhayes
"John Bokma" <[EMAIL PROTECTED]> wrote in message news:[EMAIL PROTECTED] > Dra¾en Gemiæ <[EMAIL PROTECTED]> wrote: > >> There is a person on USENET, particularly in hr. hierarchy that >> posts under three different accounts. Sometimes he argues with >> himself, and sometimes event supports himsel

Re: John Bokma harassment

2006-05-25 Thread Geoffrey Summerhayes
"John Bokma" <[EMAIL PROTECTED]> wrote in message news:[EMAIL PROTECTED] > "Geoffrey Summerhayes" <[EMAIL PROTECTED]> wrote: > >> After you kill Navarth, will it be nothing but gruff and deedle >> with a little wobbly to fill in the chinks? >

Re: Programming challenge: wildcard exclusion in cartesian products

2006-03-17 Thread Geoffrey Summerhayes
Wade Humeniuk wrote: > [EMAIL PROTECTED] wrote: > > What I have in mind is the efficient, generation of the > > complement S^n/WC(S^n). A good program should initialize, generate, and > > terminate. > > > > T=cartprodex(S,n,WC); //initialize > > for all i in T do > > what you want with i > >

Re: Programming challenge: wildcard exclusion in cartesian products

2006-03-20 Thread Geoffrey Summerhayes
"Dinko Tenev" <[EMAIL PROTECTED]> wrote in message news:[EMAIL PROTECTED] > [EMAIL PROTECTED] wrote: >> It would seem that your program is just filtering the full cartesian >> product, right? The solution I'm looking for generates the elements >> one-by-one so that it could be used in a loop. > >

Re: Programming challenge: wildcard exclusion in cartesian products

2006-03-21 Thread Geoffrey Summerhayes
<[EMAIL PROTECTED]> wrote in message news:[EMAIL PROTECTED] > After the basic fact of generating the exclusion - a considerable > achievement - the program should be interactive. What if the target set > has thousands or millions of elements? There should be a loop-like way > ('do' in Haskell, f

Re: logo design

2006-11-01 Thread Geoffrey Summerhayes
Ken Tilton wrote: > alex23 wrote: > > Xah Lee wrote: > > > >>No personal offense intended, but human animal's history is what? 3000 > >>years at least in recorded history? And, all you can think of is what, > >>the view points of a fraction of your personal life span? > > > > > > Thank god evoluti