[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: [email protected] (Mike McNally)
Date: Wed, 18 May 94 12:46:46 CDT
Cc: [email protected]
In-Reply-To: <[email protected]>
References: <[email protected]><[email protected]>
Sender: [email protected]

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 <[email protected]>       |
| TAKE TWA TO CAIRO.          ||| Tivoli Systems, Austin, TX:        |
|     (actual fortune cookie) ||| "Like A Little Bit of Semi-Heaven" |

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

References:
- Re: quantum Computing
  - From: [email protected] (Graham Toal)
- Re: quantum Computing
  - From: Rick Busdiecker <[email protected]>

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