Computer Chess Club Archives

Search

Messages

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

Author: Robert Hyatt

Date: 18:45:56 06/27/00

Go up one level in this thread

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.

• Re: New technology for the reduction of complexity and establishing proof? Jay Rinde 21:07:33 06/27/00
  • Re: New technology for the reduction of complexity and establishing proof? Robert Hyatt 06:54:38 06/28/00

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.