Author: Vincent Vega
Date: 23:59:47 03/13/01
Go up one level in this thread
On March 13, 2001 at 19:06:27, HECTOR MUNOZ wrote: >There are some who might argue that a computer chess program is not a >demonstration of intelligence in particular, a program which uses Shannon's >Type A Approach. I need to present a solid argument that such a program >does involve intelligence. If you weren't confined to just arguing for brute-force programs, you could try making an argument that the intelligence of a chess program might be demonstrated using chess-specific Turing test. Non-experts surely would have trouble realizing that they're playing a computer program, not a human player, if the program were made specifically to fool them. If you also need to argue that a simple brute-force program is a demonstration of intelligence, you could try an argument from authority (Kasparov!), argument from ignorance, attacking the opponent's character, circular reasoning, or just faking illness ;-)
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.