From: m5@vail.tivoli.com (Mike McNally)
Date: Mon, 25 Jul 94 20:10:15 PDT
To: jamesd@netcom.com (James A. Donald)
Subject: Re: GUT and P=NP
In-Reply-To: <9407241343.AA03758@vail.tivoli.com>
Message-ID: <9407242129.AA06656@vail.tivoli.com>
MIME-Version: 1.0
Content-Type: text/plain



James A. Donald writes:
 > An algorithm is a method of solving problems.  Not everything in
 > the universe is an algorithm or equivalent to an algorithm.

Ok.

 > Suppose we have a quantum computer that solves some NP (incomplete) 
 > problem in polynomial time with order one probability..
 > 
 > A numerical simulation of that computer...

Indeed, a numerical simulation would be quite complex.  However, I
fail to udnerstand why you do not consider the programming of the
quantum computer to be a non-algorithm.  Clearly, if somebody can make
the quantum computer solve the NP problem, there must be some
technique of expressing the process.  If it's not an algorithm, what
do you call it?  (Hint: it is an algorithm.)

 > The quantum computer is not equivalent to the mindless brute
 > force algorithm for solving the problem.

Right; it executes a different algorithm.

| GOOD TIME FOR MOVIE - GOING ||| Mike McNally <m5@tivoli.com>       |
| TAKE TWA TO CAIRO.          ||| Tivoli Systems, Austin, TX:        |
|     (actual fortune cookie) ||| "Like A Little Bit of Semi-Heaven" |