1994-03-30 - Re: Crypto and new computing strategies

Header Data

From: Peter Wayner <pcw@access.digex.net>
To: ravage@bga.com
Message Hash: 7fc0de6a35e167ec57ed79761b841fac747e58cd4e3584afe6f44c792a8cc10b
Message ID: <199403301930.AA19134@access2.digex.net>
Reply To: N/A
UTC Datetime: 1994-03-30 19:32:01 UTC
Raw Date: Wed, 30 Mar 94 11:32:01 PST

Raw message

From: Peter Wayner <pcw@access.digex.net>
Date: Wed, 30 Mar 94 11:32:01 PST
To: ravage@bga.com
Subject: Re: Crypto and new computing strategies
Message-ID: <199403301930.AA19134@access2.digex.net>
MIME-Version: 1.0
Content-Type: text/plain

Analog computers have very different behaviors than
digital computers. I believe that it is possible to
find the longest path in a graph merely by building
a string model of it which takes O(n) time. This
is rusty.

Some guys have also build an analog machine that can
solve 3SAT problems in linear time. They surmise, though,
that the machine must be built with precision that is
exponential in the number of terms. I.e. it won't work. 

I would assume that any QM machines will _not_ be 
exclusively digital. This is the easiest programming
model, but someone may come up with a better one.