Reply to post: Re: Small change

That virtually impossible classic compsci P vs NP problem is virtually impossible, say boffins

Anonymous Coward
Anonymous Coward

Re: Small change

> If I were clever enough to solve P=NP, I could get very rich say mining cryptocurrencies

I wonder if it is possible to prove P=NP without actually providing a P algorithm for an NP problem.

It is possible to prove that a number is composite, without learning the factors.

POST COMMENT House rules

Not a member of The Register? Create a new account here.

  • Enter your comment

  • Add an icon

Anonymous cowards cannot choose their icon