On 08/03/2012 05:27 PM, Patrick Shirkey wrote:
> There is NO PROOF that the factoring of the products of large primes is a
> fundamentally 'hard' mathematical problem. It's likely a fast algorithm
> exists and is already in the hands of several governments.
Slashdot headline: "N = NP - several governments win Fields medal" :)
Please everyone, don't take this flamebait on the linux-AUDIO lists.
> We are all exposed on the internet ;-)
news at 11.
robin
_______________________________________________
Linux-audio-user mailing list
Linux-audio-user@email-addr-hidden
http://lists.linuxaudio.org/listinfo/linux-audio-user
Received on Fri Aug 3 20:15:02 2012
This archive was generated by hypermail 2.1.8 : Fri Aug 03 2012 - 20:15:02 EEST