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: 94973152175882c3d8fdcf91fac3860c42972fec233a122112758b237ef0c30f
Message ID: <9405181746.AA11011@vail.tivoli.com>
Reply To: <199405181647.RAA02357@an-teallach.com>
UTC Datetime: 1994-05-18 17:46:58 UTC
Raw Date: Wed, 18 May 94 10:46:58 PDT

Raw message

From: m5@vail.tivoli.com (Mike McNally)
Date: Wed, 18 May 94 10:46:58 PDT
To: Rick Busdiecker <rfb@lehman.com>
Subject: Re: quantum Computing
In-Reply-To: <199405181647.RAA02357@an-teallach.com>
Message-ID: <9405181746.AA11011@vail.tivoli.com>
MIME-Version: 1.0
Content-Type: text/plain



Rick Busdiecker writes:
 > Not true.  What that means is that a polynomial time solution exists
 > for an NFA.  The only part has not been shown.

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.

--
| 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