Author: Dave Gomboc
Date: 20:00:20 09/24/01
Go up one level in this thread
On September 24, 2001 at 22:37:37, Vincent Diepeveen wrote: >Note that the statement that i could do things on 1 processor quicker then >i can proof incorrect. If you can do the same thing which you do on 2 >processor but now on 1 processor, then that would implicitly mean that >2 processors are deterministic. Because behaviour at 1 processor is >deterministic for me. > >At 2 it is not. So i cannot do what i do on 2 processors in one process. > >How's that? You can get psuedo-indeterminicy by using pseudo-random number generation. You may be encountering phenomenon similar to ideas contained in "Rapid Random Restart" in your search. I have (privately) conjectured about the feasability of this for some time already. Dave
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.