cryptoanarchy.wiki

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

1994-05-18 - Re: quantum Computing

Header Data

From: “Perry E. Metzger” <perry@imsi.com>
To: Rick Busdiecker <rfb@lehman.com>
Message Hash: e9e86ff58dc2d85d85bf8ae280c2800543cb22349d3aaa8e4b9ab0600731f48b
Message ID: <9405181805.AA02916@snark.imsi.com>
Reply To: <9405181756.AA14881@fnord.lehman.com>
UTC Datetime: 1994-05-18 18:06:22 UTC
Raw Date: Wed, 18 May 94 11:06:22 PDT

Raw message

From: "Perry E. Metzger" <perry@imsi.com>
Date: Wed, 18 May 94 11:06:22 PDT
To: Rick Busdiecker <rfb@lehman.com>
Subject: Re: quantum Computing
In-Reply-To: <9405181756.AA14881@fnord.lehman.com>
Message-ID: <9405181805.AA02916@snark.imsi.com>
MIME-Version: 1.0
Content-Type: text/plain



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

Thread