[13891] in Cypherpunks
Re: quantum Computing
daemon@ATHENA.MIT.EDU (Eli Brandt)
Wed May 18 18:03:36 1994
To: cypherpunks list <cypherpunks@toad.com>
Date: Wed, 18 May 94 14:55:28 PDT
From: Eli Brandt <ebrandt@jarthur.cs.hmc.edu>
In-Reply-To: <9405181815.AA15671@fnord.lehman.com>; from "Rick Busdiecker" at May 18, 94 2:15 pm
> 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
