From: Spike Jones (spike66@ibm.net)
Date: Fri Jul 21 2000 - 23:07:24 MDT
> > In a discussion in another forum, the question of whether computers have
> > "found" valid mathematical proofs has come up.
The trivial example is chess, where modern computers have proven
or disproven contentions by grandmasters about an unclear position.
The classic example is the 20th game in the 1972 championship between
Spassky and Fischer where Spassky suddenly resigned in a very
unsettled situation. The top guys argued about it for years, but many
contended that Boris had a shot that would have given him an excellent
chance for at least a draw. Deep Blue "proved" by exhaustive 30 ply
analysis (which is beyond human capacity) that the commie in fact
resigned in a winning position, fully convinced that he was busted.
Fischer had that effect on his opponents. But he would *not* have
so effected a cold blooded computer.
spike
This archive was generated by hypermail 2.1.5 : Fri Nov 01 2002 - 15:30:06 MST