[13871] in Cypherpunks
Re: quantum Computing
daemon@ATHENA.MIT.EDU (Rick Busdiecker)
Wed May 18 14:07:50 1994
To: m5@vail.tivoli.com (Mike McNally)
Cc: cypherpunks@toad.com
In-Reply-To: Your message of "Wed, 18 May 1994 12:46:46 CDT."
<9405181746.AA11011@vail.tivoli.com>
From: Rick Busdiecker <rfb@lehman.com>
Reply-To: Rick Busdiecker <rfb@lehman.com>
Date: Wed, 18 May 1994 13:56:12 -0400
-----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-----
