Author: Otello Gnaramori
Date: 15:00:21 04/21/02
Go up one level in this thread
On April 21, 2002 at 11:22:55, Janosch Zwerensky wrote: >>So what? A ZFC theorem prover can do the same, in principle (of course, we don't >have automated all-purpose theorem provers today which could compete with a >trained mathematician --- but this does not show that computers can't be >programmed to do the work of a mathematician *in principle*, given enough >computing power). You said that ; a theorem prover...not a theorem creator. The difference is between reproductive and creative as I stated previously, and it is an *huge* difference IMHO. w.b.r. Otello
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.