From: Anders Sandberg (nv91-asa@nada.kth.se)
Date: Sun Jan 26 1997 - 15:20:55 MST
On Sat, 25 Jan 1997, Eliezer Yudkowsky wrote:
> An FTL Drive? See http://tezcat.com/~eliezer/workarounds.html
I *knew* it! :-)
> > >If two
> > > million branches of reality try to write to the same byte, the result is
> > > an "ugly mess", as the saying goes.
> >
> > But remember that they write to two million branches of memory too...
>
> I'm talking read-out, not the interim computation.
Yes, you are right. That is the problem in many ways. It is also
dissipative, which is irritating.
> You'd think that
> 2^64 branches of reality would let you evolve 2^64 computations to find
> the best one... but you can only 'read-out', say, a million of the
> best... and if two million of the best try to write to the same
> 'read-out' memory, the result is an ugly mess when two million branches
> of reality undergo state-vector reduction.
The trick in creating quantum algorithms consists of making most branches
interfere each other away, leaving something useful (like Shor's
algorithm).
-----------------------------------------------------------------------
Anders Sandberg Towards Ascension!
nv91-asa@nada.kth.se http://www.nada.kth.se/~nv91-asa/main.html
GCS/M/S/O d++ -p+ c++++ !l u+ e++ m++ s+/+ n--- h+/* f+ g+ w++ t+ r+ !y
This archive was generated by hypermail 2.1.5 : Fri Nov 01 2002 - 14:44:04 MST