Computer Chess Club Archives


Search

Terms

Messages

Subject: Here we go again ;-) complexity defined:

Author: Dann Corbit

Date: 16:27:00 05/16/01


From:
http://www.xrefer.com/entry.jsp?xrefid=343703
We have:
"In computing, it is vital to have some idea of how long a program will take to
execute before it is run. If it is going to take the whole of the lifetime of
the universe before the computer comes up with the answer to a problem, then it
is pointless to tie up valuable hardware to try and solve it. The concept of how
long an algorithm will take to solve a given problem is that of complexity."

Now please, for those who want to continue the discussion, can't we take it to
email?  I rather suspect that the vast majority of CCC members couldn't give a
rat's posterior about whether chess is computable or not.

Relevant email addresses:
-------------------------
hyatt@crafty.cis.uab.edu
dcorbit@solutionsiq.com
jwes@oro.net
blass_n@netvision.net.il
jesan733@student.liu.se



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.