Author: José de Jesús García Ruvalcaba
Date: 03:31:26 12/11/02
Go up one level in this thread
On December 10, 2002 at 18:24:40, Dann Corbit wrote: >On December 10, 2002 at 18:05:15, Ingo Lindam wrote: > >>On December 10, 2002 at 17:56:49, Uri Blass wrote: >> >>>On December 10, 2002 at 17:51:40, Ingo Lindam wrote: >>> >>>>On December 10, 2002 at 17:30:47, Dann Corbit wrote: >>>> >>>>>On December 10, 2002 at 13:42:36, Bernardo Wesler wrote: >>>>>[snip] >>>>>>THE ALGORITHM. A MATHEMATICAL FORMULA THAT , FOR EXAMPLE, ASSURE YOU THAT IF YOU >>>>>>DO THE FIRST MOVE YOU ALWAYS WIN. >>>>>>I MEAN TO THINK ABOUT DISCOVERING A CHESS ALGORITHM IS AN UTHOPY? >>>>> >>>>>Provably impossible on current hardware and software systems. >>>>>Maybe in 100 years the game will be formally solved. Not in the near futre. >>>> >>>>provably impossible on current hardware...? >>>>are you sure? >>> >>>I think he meant probably and not provably. >> >>unfortunately I meant provably and is absolutely sure that there isn't any doubt >>about this! >> >>so I guess the answer/solution/proof on the question: How many prime numbers >>exist? > >The number of primes is uncountable. Euclid proved it quite a while ago. > It is 'infinite'. 'uncountable' is a technical mathematical word in English which means something else (and no, the set of prime numbers is not uncountable). José.
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.