Live data from Hacker News

Ask HN: P=NP, what do you do?

news.ycombinator.com

51–60 of 70 posts

Re: Ask HN: P=NP, what do you do?

#51
Ring Intel's CEO. You have the means to give him optimal layout for his CPUs saving them both massive amounts of time and more importantly space on CPUs. If you like you can also approach AMD and get the two bidding against each other.

They will bite your hand off and you will be a rich man.

Re: Ask HN: P=NP, what do you do?

#52
post #21

Test driven development would take on a new meaning, with the programmer a writing collection of tests and letting the computer find the shortest program that makes them pass.

This would probably produce a program that cheats a lot. Perhaps not by simply hardcoding the answers to the tests, but by finding a good compressing function for the set of (input, output) pairs in the test. I bet this would seldom provide the expected answers on inputs not covered by the tests.

Re: Ask HN: P=NP, what do you do?

#53
post #48

Well, if you write a theorem prover, you can probably get just about every mathematical proof prize out there. That's $7 million from the Clay Institute alone...

Just make sure that you publish the proof for P=NP last, otherwise others could beat you to it :)

Re: Ask HN: P=NP, what do you do?

#54
post #21

Test driven development would take on a new meaning, with the programmer a writing collection of tests and letting the computer find the shortest program that makes them pass.

One important thing about TDD, in my view, is that you have two separate descriptions (the test and the code) that agree. If you get your code generated from your tests then how do you detect bugs in your tests?

Re: Ask HN: P=NP, what do you do?

#56

I've always thought that this would make a great plot for a science fiction novel. A computer science fiction novel. There would be lots of intrigue, as the guy was tracked down by the NSA and covertly outwitted his opponents using his proof, until a final showdown where he discovers the horrifying truth about who else knows that P=NP, and what happens to everyone else who's ever proven it. So...should I look for a l…

Sounds like something Dan Brown would write.

Re: Ask HN: P=NP, what do you do?

#57
post #21

Test driven development would take on a new meaning, with the programmer a writing collection of tests and letting the computer find the shortest program that makes them pass.

Or writing a formal specification which would resolve the problems mentionned in the sibling comments.

Re: Ask HN: P=NP, what do you do?

#58
post #52
post #21

Test driven development would take on a new meaning, with the programmer a writing collection of tests and letting the computer find the shortest program that makes them pass.

This would probably produce a program that cheats a lot. Perhaps not by simply hardcoding the answers to the tests, but by finding a good compressing function for the set of (input, output) pairs in the test. I bet this would seldom provide the expected answers on inputs not covered by the tests.

I second this. Overfitting can be a problem even in human-written test scenario's. Usually overconfidence in your test suite is a cause.

Re: Ask HN: P=NP, what do you do?

#59
post #51

Ring Intel's CEO. You have the means to give him optimal layout for his CPUs saving them both massive amounts of time and more importantly space on CPUs. If you like you can also approach AMD and get the two bidding against each other. They will bite your hand off and you will be a rich man.

Please call ARM and its Si partners first. Thanks.

Re: Ask HN: P=NP, what do you do?

#60
post #53
post #48

Well, if you write a theorem prover, you can probably get just about every mathematical proof prize out there. That's $7 million from the Clay Institute alone...

Just make sure that you publish the proof for P=NP last, otherwise others could beat you to it :)

Not really, anyone could use your prover to prove P=NP. It's Pandora's box!
Post reply on HN