Computer Chess Club Archives


Search

Terms

Messages

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

Author: Robert Hyatt

Date: 06:54:38 06/28/00

Go up one level in this thread


On June 28, 2000 at 00:07:33, Jay Rinde wrote:

>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



:)






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.