[LAU] How can we convert money to fixing bugs in software?

[Robin Gareus]

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