Path: utzoo!utgpu!jarvis.csri.toronto.edu!rutgers!iuvax!cica!tut.cis.ohio-state.edu!pt.cs.cmu.edu!cat.cmu.edu!jps
From: jps@cat.cmu.edu (James Salsman)
Newsgroups: comp.arch
Subject: More math...
Keywords: turing np parallel SIMD MIMD
Message-ID: <5533@pt.cs.cmu.edu>
Date: 15 Jul 89 03:10:23 GMT
Organization: Carnegie Mellon
Lines: 14


Most complexity theory that evaluates the difference
between regular algorithms and NP-complete algorithms
seems to be based on turing machines.

Turing machines are the paridigm of serial machines!

How can all these classifications be correct for
multiprocessors and other parallel machines?

:James
-- 

:James P. Salsman (jps@CAT.CMU.EDU)