[Date Prev][Date Next][Thread Prev][Thread Next][Date Index][Thread Index]

Re: quantum Computing

To: Rick Busdiecker <[email protected]>
Subject: Re: quantum Computing
From: "Perry E. Metzger" <[email protected]>
Date: Wed, 18 May 1994 14:05:49 -0400
Cc: [email protected] (Mike McNally), [email protected]
In-Reply-To: Your message of "Wed, 18 May 1994 13:56:12 EDT." <[email protected]>
Reply-To: [email protected]
Sender: [email protected]


Rick Busdiecker says:
>     From: [email protected] (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

References:
- Re: quantum Computing
  - From: Rick Busdiecker <[email protected]>

Prev by Date: Re: quantum Computing
Next by Date: Re: your mail
Prev by thread: Re: quantum Computing
Next by thread: Re: quantum Computing
Index(es):
- Date
- Thread