[13874] in Cypherpunks
Re: quantum Computing
daemon@ATHENA.MIT.EDU (Perry E. Metzger)
Wed May 18 14:17:24 1994
To: Rick Busdiecker <rfb@lehman.com>
Cc: m5@vail.tivoli.com (Mike McNally), cypherpunks@toad.com
In-Reply-To: Your message of "Wed, 18 May 1994 13:56:12 EDT."
<9405181756.AA14881@fnord.lehman.com>
Reply-To: perry@imsi.com
Date: Wed, 18 May 1994 14:05:49 -0400
From: "Perry E. Metzger" <perry@imsi.com>
Rick Busdiecker says:
> 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.
A turing machine is not a finite automaton -- it has an infinite tape.
Perry
