cryptoanarchy.wiki

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

1994-05-18 - Re: quantum Computing

Header Data

From: m5@vail.tivoli.com (Mike McNally)
To: Rick Busdiecker <rfb@lehman.com>
Message Hash: 3f7c9165952b29cd4aa2c117fbbcad60f1e047f14499a8645f15a0f9390b313b
Message ID: <9405181803.AA11052@vail.tivoli.com>
Reply To: <9405181746.AA11011@vail.tivoli.com>
UTC Datetime: 1994-05-18 18:03:55 UTC
Raw Date: Wed, 18 May 94 11:03:55 PDT

Raw message

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



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

Uhh, isn't it the case that a Turing machine can simulate an NFA, but
not the reverse?  An NFA has no tape, and therefore is not as powerful
an automaton as a Turing machine.  Thus an NFA can be implemented by
an NTM, but not the reverse.

I think.

--
| GOOD TIME FOR MOVIE - GOING ||| Mike McNally <m5@tivoli.com>       |
| TAKE TWA TO CAIRO.          ||| Tivoli Systems, Austin, TX:        |
|     (actual fortune cookie) ||| "Like A Little Bit of Semi-Heaven" |

Thread