Computer Chess Club Archives


Search

Terms

Messages

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

Author: Hans Gerber

Date: 05:51:24 06/27/00

Go up one level in this thread


On June 27, 2000 at 08:40:04, Mogens Larsen wrote:


>Since there's no decisive proof for and against the claim of cheating, it's a
>futile discussion and I fail to see the importance. The exhibition game is old
>news by now. It was barely interesting then as far as I'm concerned and
>completely insignificant now. Let it go.
>
>Best wishes...
>Mogens

Yes, thanks. Exactly! That is the reason why I wrote several posts. To clarify
that it is by no mean p-r-o-v-e-n that Kasparov asked unreasonable and already
answered questions.

I agree with you that until these questions have not been answered the whole
debate here in CCC is uninteresting. On the other hand I find it not fair if
some people always repeat the same stuff to spoil Kasparov and his integrity.

He asked the perhaps most important question for computerchess of these days.
But he is treated as if the IBM logfiles had already answered all possible
questions. Let us stop this.


Hans



This page took 0.01 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.