Computer Chess Club Archives


Search

Terms

Messages

Subject: Re: New technology for the reduction of complexity and establishing proof?

Author: Jay Rinde

Date: 21:07:33 06/27/00

Go up one level in this thread


Well, yes, it is impossible to prove that something did not happen. But there is
a solution.  Since you can prove a positive, perhaps IBM can prove they did
cheat, then the critics can show that the IBM proof is faulty! JAY



On June 27, 2000 at 21:45:56, Robert Hyatt wrote:

>On June 27, 2000 at 20:02:43, Hans Gerber wrote:
>
>>Here is the exact text of what Kasparov said:
>>
>>"Let's just say this: IBM categorically refuses to submit any proof that
>>this [cheating] did not occur.
>>No one can really prove this, but the information we have at hand..."
>>
>>
>>Hans Gerber
>
>
>What does he want?  A sworn statement from God?  The printouts look perfectly
>normal.  IBM can't prove they didn't cheat.  Again, that is _impossible_ to
>do.



This page took 0 seconds to execute

Last modified: Thu, 15 Apr 21 08:11:13 -0700

Current Computer Chess Club Forums at Talkchess. This site by Sean Mintz.