cryptoanarchy.wiki

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

1994-05-18 - Re: quantum Computing

Header Data

From: Eli Brandt <ebrandt@jarthur.cs.hmc.edu>
To: cypherpunks list <cypherpunks@toad.com>
Message Hash: 242cd4dad9208a639bfe27aa9128b55c95455a499f294e05d4c1da379cdc6545
Message ID: <9405182155.AA08254@toad.com>
Reply To: <9405181815.AA15671@fnord.lehman.com>
UTC Datetime: 1994-05-18 21:55:44 UTC
Raw Date: Wed, 18 May 94 14:55:44 PDT

Raw message

From: Eli Brandt <ebrandt@jarthur.cs.hmc.edu>
Date: Wed, 18 May 94 14:55:44 PDT
To: cypherpunks list <cypherpunks@toad.com>
Subject: Re: quantum Computing
In-Reply-To: <9405181815.AA15671@fnord.lehman.com>
Message-ID: <9405182155.AA08254@toad.com>
MIME-Version: 1.0
Content-Type: text/plain


> From: Rick Busdiecker <rfb@lehman.com>
> It's a matter of definition, I suppose.  Hopcroft and Ullman describe
> an NFA as having a tape.

I find this a little odd, given that the "F" stands for "finite".
Checking Hopcroft and Ullman, they define an NFA formally as a
tuple: states, inputs, initial state, final states, and a mapping
from states cross inputs to 2^states.  No tape.

   Eli   ebrandt@hmc.edu

Thread