Oracle FAQ Your Portal to the Oracle Knowledge Grid
HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US
 

Home -> Community -> Usenet -> comp.databases.theory -> Re: Nearest Common Ancestor Report (XDb1's $1000 Challenge)

Re: Nearest Common Ancestor Report (XDb1's $1000 Challenge)

From: Hugo Kornelis <hugo_at_pe_NO_rFact.in_SPAM_fo>
Date: Tue, 01 Jun 2004 23:23:55 +0200
Message-ID: <dfspb0hlji1psroiomkklo8ebf2nb4mlqn@4ax.com>


On 1 Jun 2004 02:52:24 GMT, Christopher Browne wrote:

(snip)
>Why would anyone imagine that the promise to pay $1000 was an honest
>one?
>
>It's a publicity stunt that "Neo" can't afford the embarrassment of
>losing. If someone can 'win' the prize, then that's effectively a
>proof that his product is snakeoil.

Hi Christopher,

I didn't believe that claim from day one. But that won't restrain me from reminding Neo of his debt at appropriate moments - until he understands that he'd better stop spamming these newsgroups with his advertisements forever.

Personally, I even doubt if Neo *could* pay me even if he wanted to. He might well be unable to pay until he's sold some copies of XDb1 - and now that I've seen how both XDb1 and Neo totally fail to live up to their promises, that seems a quite unlikely event.

Of course, I wouldn't mind to be proven wrong on this...

Best, Hugo

-- 

(Remove _NO_ and _SPAM_ to get my e-mail address)
Received on Tue Jun 01 2004 - 16:23:55 CDT

Original text of this message

HOME | ASK QUESTION | ADD INFO | SEARCH | E-MAIL US