cryptoanarchy.wiki

Arise, you have nothing to lose but your barbed wire fences!

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

Header Data

From: m5@vail.tivoli.com (Mike McNally)
To: Jim choate <ravage@bga.com>
Message Hash: 6db1ef2429bc2c96da647de6caf1a7c35e39b5436cba4cec13908d7a5999b736
Message ID: <9403301931.AA19705@vail.tivoli.com>
Reply To: <199403301754.AA00993@zoom.bga.com>
UTC Datetime: 1994-03-30 19:31:32 UTC
Raw Date: Wed, 30 Mar 94 11:31:32 PST

Raw message

From: m5@vail.tivoli.com (Mike McNally)
Date: Wed, 30 Mar 94 11:31:32 PST
To: Jim choate <ravage@bga.com>
Subject: Re: Crypto and new computing strategies
In-Reply-To: <199403301754.AA00993@zoom.bga.com>
Message-ID: <9403301931.AA19705@vail.tivoli.com>
MIME-Version: 1.0
Content-Type: text/plain



Jim choate writes:
 > Also there is the potential to use neural networks at these levels
 > (which are not necessarily reducable to Turing models, the premise
 > has never been proven) 

Uhh, gee; given that I've seen neural networks implemented on
conventional computer systems, and as far as I know those were
perfectly functional (if slow) neural networks, I think that pretty
much proves it (as if it needed to be).

I'd say that the burden of proof is to demonstrate that there are
algorithms implementable on a neural network which are unimplementable
on a Turing machine.  That'd be a pretty significant breakthrough.

 > The bottom line is that this whole area is a unknown and if we persist in 
 > carrying unproven assumptions from the macro-world over into the QM
 > model we WILL be in for a nasty surprise.

Complexity theory doesn't have anything to do with any world, macro-
or micro- or mega- or whatever.  It's mathematics.

--
| 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" |

Thread