Computer Chess Club Archives

Search

Messages

Subject: superlinuar speedups What says theory?

Author: Olaf Jenkner

Date: 10:52:56 10/08/01

Go up one level in this thread

I'm mathemathician. I believe that every student of informatics learnt something
about this topic. Maybe we can construct a turing machine to prove the
impossibilaty of SS. Is this the case? If it is, why does Dr. Hyatt waste his
time to convince people about it?

OJe

• Re: superlinuar speedups What says theory? Robert Hyatt 11:59:12 10/08/01
  • Re: superlinuar speedups What says theory? Miguel A. Ballicora 14:12:37 10/10/01
    • Re: superlinuar speedups What says theory? Robert Hyatt 10:38:20 10/11/01
    • Re: superlinuar speedups What says theory? Dave Gomboc 17:57:10 10/10/01
      • Re: superlinuar speedups What says theory? Robert Hyatt 10:40:44 10/11/01
  • what else can be done Olaf Jenkner 14:31:57 10/08/01

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.