Author: Robert Hyatt
Date: 15:20:39 09/27/01
Go up one level in this thread
On September 27, 2001 at 18:06:34, Olaf Jenkner wrote: >>If you can consistently produce a speedup of 3.0, then I can time- >>slice that same algorithm on one cpu and get a speedup of 1.5. And I can do it >>for _any_ alpha/beta algorithm you do in parallel. Every time. And using your >>code, it will be easy for me to do it. >> >It's a good explanation. Some people seem to believe to perpetuum mobiles. > >OJe I lived in South Mississippi for 17 years, on the computer science faculty at the university of southern mississippi. We had a moron that lived in Wiggins, Mississippi (about 30 miles south of Hattiesburg where USM was located) that developed a perpetual motion machine. He conned the press into believing this. But he couldn't con the US Patent Office. And he took them to court to force them to give him a patent. At the trial he refused to open his "machine" up since he had no patent yet. The whole mess was thrown out. But it attracted national (negative) attention to our area. Many still believe that he was "screwed". He was. But mentally, Not by the patent office. :)
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.