From: jamesd@netcom.com (James A. Donald)
Date: Fri, 15 Jul 94 23:00:35 PDT
To: rjc@gnu.ai.mit.edu (Ray)
Subject: Re: Key length security (calculations!)
In-Reply-To: <9407150903.AA18447@geech.gnu.ai.mit.edu>
Message-ID: <199407160600.XAA24435@netcom8.netcom.com>
MIME-Version: 1.0
Content-Type: text/plain


James Donald writes:
> > In the highly unlikely event that P = NP then we have also solved, as
> > an almost trivial special case, the problems of true artificial
> > intelligence, artificial consciousness, and artificial perception,
> > and the failure of one particular form of crypto will not be noticed
> > in the midst of such radical changes.

Ray writes
>   When was AI proved NP? 

It has not been proved to be NP.  But all known methods are NP.  If
P=NP then these methods could be executed in polynomial time.

If there is nothing strange about the brain, then either AI is not
NP, or P=NP

We are wandering rather far from cryptography, so I will refrain
from discussing the description of the perception problem in
terms of a special case of a problem whose general case is NP
complete.


-- 
 ---------------------------------------------------------------------
We have the right to defend ourselves and our
property, because of the kind of animals that we              James A. Donald
are.  True law derives from this right, not from
the arbitrary power of the omnipotent state.                jamesd@netcom.com