P = Np ? - Contractor UK Bulletin Board

Visitors can check out the Forum FAQ by clicking this link. You have to register before you can post: click the REGISTER link above to proceed. To start viewing messages, select the forum that you want to visit from the selection below. View our Forum Privacy Policy.
Want to receive the latest contracting news and advice straight to your inbox? Sign up to the ContractorUK newsletter here. Every sign up will also be entered into a draw to WIN £100 Amazon vouchers!

You are not logged in or you do not have permission to access this page. This could be due to one of several reasons:

You are not logged in. If you are already registered, fill in the form below to log in, or follow the "Sign Up" link to register a new account.
You may not have sufficient privileges to access this page. Are you trying to edit someone else's post, access administrative features or some other privileged system?
If you are trying to post, the administrator may have disabled your account, or it may be awaiting activation.

Diestl replied

16 October 2009, 08:24
Leave a comment:
NotAllThere replied

16 October 2009, 07:47
On the other hand, even if you axiomise P=NP (or P#NP), you'll still get undecidability in your problem space.
Leave a comment:
threaded replied

16 October 2009, 05:12
Depends totally on the axioms for the problem space.

If the axiom set can be used to prove P=NP then yes, if they can prove the opposite, then the answer is no.

Simples.

threaded in "please save us from GCSEs in IT" mode
Leave a comment:
TimberWolf started a topic P = Np ?

15 October 2009, 23:59
P = Np ?

Interesting article here about recent status/developments in the most open question in computer science, mathematics, logic, physics...

Highlights include that factoring and finding discrete logarithms are not thought to be NP-complete (these are used in cryptography), that whether P=NP may never be known and that quantum computers would probably not help solve NP complete problems.

I also read recently that 15 had been successfully factored by quantum computer. Although a classical computer was required to complete the job.
Tags: None

Working...

X