I'm sure this is a classic problem, related to the "NC"ness properties of graph connectivity or some such. Discussion and or references are appreciated. How...
242
Jeffrey Considine
jconsidi@...
Nov 2, 1998 3:35 pm
... I haven't seen this problem before, but here's a stab at starting it. ... For each vertex, have one variable. Pick a vertex and set its variable to true....
243
Stas Busygin
busygin@...
Nov 3, 1998 12:11 am
Hi All,
Claude, thank you for an idea of the refutation. I'll return to GI after a
while.
Vladimir, I have never said I did benchmarking of my method for...
244
Vladimir Z. Nuri
vznuri@...
Nov 3, 1998 9:03 am
Claude, nice work on a counterexample. I admit I'm not following the exact trains of thought here but it looks good on paper. or in electrons, so to speak!! ...
245
JDPeh@...
Nov 6, 1998 3:47 am
This email message contains blatant self-promotion, a brief explanation of the situation, and a request for assistance. And its all true. But please, if...
246
Klaus D. Witzel
kwitzel@...
Nov 6, 1998 4:46 pm
Vladimir, I would be willing and able to donate money into a funds (or however that is called) in order to support Dan and others. Could you please consider...
247
Vladimir Z. Nuri
vznuri@...
Nov 8, 1998 7:27 am
(admin: I think there seems to be some email distr problems lately. if anyone wonders, check out the web site and see if there are messages there you haven't...
248
Nico Benschop
benschop@...
Nov 8, 1998 9:20 am
... Hi Dan, I sympathise with your plight, trying to find work. You are a smart guy, but even without a degree (say MSc. which you *should* definitely try to...
249
Derik Hawley.
dhawley@...
Nov 8, 1998 5:26 pm
Hello: A general question: Does anybody know a good textbook on graph grammars? ... To Dave P: You may want to contact a university with your program. If you...
250
Nico Benschop
benschop@...
Nov 8, 1998 6:23 pm
... http://www.iae.nl/users/benschop/c-ranksm.dvi <--- corrected URL ... Ciao, Nico Benschop. | AHA: One is Always Halfway Anyway ...
251
Vladimir Z. Nuri
vznuri@...
Nov 9, 1998 2:37 am
thanks for the recent post Nico. as an intro to everyone, nico has a lot of reasons to complain about the world-- rejected papers, people who don't understand...
252
JDPeh@...
Nov 9, 1998 11:26 am
... OK. Enough crying over not enough milk. Here's a simple construction, that I do not fully understand. ... Complete Binary Trees, Reals, and Integers. ...
253
Nico Benschop
benschop@...
Nov 9, 1998 7:49 pm
... .... likewise ;-) [les extremes se touchent] For the source of this misunderstanding (bobs@... on sci.math) see...
254
Nico Benschop
benschop@...
Nov 9, 1998 8:23 pm
... Yes, I think it is useful. Reminds me of the heated discussions on sci.math about Cantor's diagonal - and the uncountable reals ;-) The tree representation...
255
SuperRyan@...
Nov 9, 1998 8:25 pm
... ==> Any real can be mapped to an infinite subset of integers? ==> The set of infinite subsets of integers is |R ? Just prodding. Your construction reminds...
256
Stas Busygin
busygin@...
Nov 9, 1998 11:35 pm
Hi Dan, ... As far as I could understand your question is about is there any contradiction with the inequality |[0..1]|>|Z| (where |.| means cardinality, Z -...
257
Nico Benschop
benschop@...
Nov 10, 1998 12:04 am
... http://x10.dejanews.com/getdoc.xp?AN=394801048.1&search=thread&threaded=1&CONTEXT=910655786.1641414768&hitnum=0 ... See the original message at...
258
Sommer Gentry
gentry6@...
Nov 10, 1998 12:32 am
... There are no branches in an unbounded depth tree. Unbounded, I presume, means that for any M, there exist nodes whose depth is > M. If you tell me that...
259
Sommer Gentry
gentry6@...
Nov 10, 1998 12:40 am
... the ... structure to ... A stack has order, therefore it is countable. Top of the superstack is 1, next lower element is 2, etc. A superstack with...
260
Derik Hawley.
dhawley@...
Nov 10, 1998 4:03 am
Summer Gentry wrote: "This is true. But that does not imply that the reals are countable, since the nodes in the tree correspond ONLY to reals with finite...
261
Nico Benschop
benschop@...
Nov 10, 1998 8:44 am
Hi Dan, ... (*): For depth k the number of leaves (final nodes) is 2^k. The total nr of nodes is \sum 2^i (i=0..k) = 2^(k+1) -1. The nr of branches = nr of...
262
JDPeh@...
Nov 10, 1998 9:53 am
... Good point. It would be more accurate to say, any real can be mapped to as specific a subtree as you want, to differentiate it from any other reals in a...
263
p.hines
max003@...
Nov 10, 1998 11:52 am
Hi, Stan etc. ... no time to write much (I'm half way through teaching a class), but I thought I'd point out that this is the binary tree (or infinite strings...
264
Vladimir Z. Nuri
vznuri@...
Nov 10, 1998 8:24 pm
hi everyone, regarding stacks and trees, and enumerating them, John Conway has some very cool work into uncountable sets and the continuum that this thread...
265
p.hines
max003@...
Nov 11, 1998 4:20 pm
Hi. Slightly more time now, so I thought I'd try to explain why this is a very interesting construction (or at least why I think it is ...) ... The interesting...
266
SuperRyan@...
Nov 11, 1998 5:17 pm
In a message dated 11/9/98 7:41:54 PM Eastern Standard Time, gentry6@... writes: << >While you can have only countably many elements on any superstack,...
267
SuperRyan@...
Nov 11, 1998 6:15 pm
In a message dated 11/10/98 4:54:19 PM Eastern Standard Time, vznuri@... writes: << regarding stacks and trees, and enumerating them, John Conway has...
268
Jeffrey Considine
jconsidi@...
Nov 11, 1998 6:54 pm
... How about assigning a letter to each element within a stack since there are finitely many of them and give a string describing the path from the root, one ...
269
Nico Benschop
benschop@...
Nov 11, 1998 6:58 pm
... I am not so sure it was me who asked for that ;-) ...(Was'nt it V.N?) It's excellent, Peter. I'll check some of your mentioned papers. The math I am a bit...
270
Sommer Gentry
gentry6@...
Nov 11, 1998 7:57 pm
<snip> ... number of ... Finite != Countable. Stacks can contain countably infinite elements. I maintain that the stack data structure, even the superstack...
