Newsgroups: comp.ai.genetic
Path: cantaloupe.srv.cs.cmu.edu!fs7.ece.cmu.edu!hudson.lm.com!godot.cc.duq.edu!news.duke.edu!news.mathworks.com!udel!gatech!howland.reston.ans.net!pipex!sunsite.doc.ic.ac.uk!hgmp.mrc.ac.uk!news.dcs.warwick.ac.uk!not-for-mail
From: B.Barnes@dcs.warwick.ac.uk (Benjohn Barnes)
Subject: Re: The Prime Numbers!!
Message-ID: <1994Nov15.162630.21735@dcs.warwick.ac.uk>
Sender: news@dcs.warwick.ac.uk (Network News)
Nntp-Posting-Host: granite
Organization: Department of Computer Science, Warwick University, England
References: <3a0sbf$4h1@news.bu.edu> <1994Nov12.145248.18099@inca.comlab.ox.ac.uk>
Date: Tue, 15 Nov 1994 16:26:30 GMT
Lines: 22

trin0008@sable.ox.ac.uk (  Ranora Ryder) writes:

>In article <3a0sbf$4h1@news.bu.edu>, Samuel Fauteck <sfauteck@bu.edu> wrote:
>>I have an idea and am interested in the opinions/ideas of the group...  If I
>>am way off-base I apologize ahead of time.  As everyone is aware, the problem
>>of determining whether or not a number is prime is computationally very
>>difficult (indeed - it is NP complete).  I originally thought of the idea of

>Utter drivel. The problem of finding the primality of a number is NOT NP-C
>and not NP either. Some recent algorithms have approached polynomial time very
>closely although none have reached it. I seem to remember that one method only
>misses P time by a factor of log log N.
>The factoring problem is not proven to be in NP either. Some recent papers to 
>do with so called 'quantum computing' suggests that the problem is more
>tractable than previously thought.

>	Ranora Ryder

But quantum computing (as far as I understand) sets up the problem in many
different parallel universes at the same time. It cheats.

	Benjohn
