cryptoanarchy.wiki

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

1994-05-18 - Re: quantum Computing

Header Data

From: Rick Busdiecker <rfb@lehman.com>
To: m5@vail.tivoli.com (Mike McNally)
Message Hash: d295c55cb7743e665e7a5966fce59e64ae73c24270c60adf14772e579143585a
Message ID: <9405181756.AA14881@fnord.lehman.com>
Reply To: <9405181746.AA11011@vail.tivoli.com>
UTC Datetime: 1994-05-18 17:56:38 UTC
Raw Date: Wed, 18 May 94 10:56:38 PDT

Raw message

From: Rick Busdiecker <rfb@lehman.com>
Date: Wed, 18 May 94 10:56:38 PDT
To: m5@vail.tivoli.com (Mike McNally)
Subject: Re: quantum Computing
In-Reply-To: <9405181746.AA11011@vail.tivoli.com>
Message-ID: <9405181756.AA14881@fnord.lehman.com>
MIME-Version: 1.0
Content-Type: text/plain


-----BEGIN PGP SIGNED MESSAGE-----

    Date: Wed, 18 May 94 12:46:46 CDT
    From: m5@vail.tivoli.com (Mike McNally)
    
    While we're being picky, I'll point out that (unless I'm wrong of
    course) it's not really an NFA, but a non-deterministic Turing
    machine (an "NTM"?) that's the automaton at issue here.

No, NFA is acceptable and correct, it's Non-determinisic Finite
Automaton.  A non-deterministic Turing machine is a perfectly
reasonable example, however.

			Rick

-----BEGIN PGP SIGNATURE-----
Version: 2.3a

iQCVAgUBLdpWthaZNKPPNj41AQEttwQAnCs9sZ+fV9BhCMf/PXyM6w59NjIc8ZwF
vVL394XfzqvQKUzwK8pV04d5YMusfgbVibj+IuEaAEkn9qMYkaoX9XL65tzhPf8N
6bilBkRVIuCmLye9J0vpylouqS7bAakF7Htu06EDOzTQArBXEWUaBGkaH5P+m8xu
xQLMS1RmmKk=
=H5dW
-----END PGP SIGNATURE-----

Thread