Re: Key length security (calculations!)

[rjc@gnu.ai.mit.edu (Ray)]

James Donald writes:
> Timothy C. May writes
> > ... if P = NP, then fast factoring
> > methods may be found (fast = polynomial in length). 
> 
> 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.

  When was AI proved NP? AFAIK, definitions of intelligence
and consciousness aren't even generally agreed on. Consciousness
especially.  Any citations on this claim? The only place I've
heard this before was your claim on the Extropians list last year that
AI required solving NP problems (and that a good answer would not
work), therefore classical computers couldn't do it, but quantum
computers could, and therefore the mind is based on quantum mechanics
and AI won't work.