 |
|
| Science Forum Index » Logic Forum » NC+NP+P != All programs |
|
Page 1 of 1 |
|
| Author |
Message |
| Denis Flex |
 Posted: Sat Jan 24, 2004 8:22 am |
|
|
|
Guest
|
NC (non computable) + NP (non polinomial) + P (polinomial ) != All
prgrams
What is the class name of the other programs?
Thanks , Denis. |
|
|
| Back to top |
|
|
|
| G. Frege |
| Posted: Sat Jan 24, 2004 11:02 pm |
|
|
|
Guest
|
|
| Back to top |
|
|
|
| The Ghost In The Machine |
| Posted: Sun Jan 25, 2004 11:59 am |
|
|
|
Guest
|
In sci.logic, G Frege
<no_spam@aol.com>
wrote
on Sun, 25 Jan 2004 05:02:00 +0100
<i9e610d1g5p174rjli8silunht6v4eggk4@4ax.com>:
[quote:2063be2f9c]On Sun, 25 Jan 2004 00:59:54 GMT, The Ghost In The Machine
ewill@sirius.athghost7038suus.net> wrote:
I don't know if anyone's proved P = NP or P != NP yet;
it was fairly hotly debated when I left school in '83.
I've not kept up with it since.
It's still an open problem. And you can earn a lot of money ($1,000,000)
if you provide a solution for it. 
[/quote:2063be2f9c]
Heh...my complexity theory is so rusty it creaks. Still,
it looks like somebody's made progress; there's a P solution
to the problem of finding out whether a number is prime or not
that was found in 2002.
http://crypto.cs.mcgill.ca/~stiglic/PRIMES_P_FAQ.html
(Fortunately, there's little or no impact on RSA encryption.)
[quote:2063be2f9c]
F.
Source:
http://en.wikipedia.org/wiki/Millennium_Prize_Problems
More on P = NP?:
http://en.wikipedia.org/wiki/Complexity_classes_P_and_NP
[/quote:2063be2f9c]
--
#191, ewill3@earthlink.net
It's still legal to go .sigless. |
|
|
| Back to top |
|
|
|
|
|
All times are GMT - 5 Hours
The time now is Sun Dec 06, 2009 2:31 pm
|
|