Every story and comment from the Hacker News API, in a layout borrowed from 2001.
A comment on Darwin: a genomics co-processor provides up to 15,000x acceleration. Parent comment
I am fairly certain you can design your problem to behave in a similar manner or in some manner that increases the complexity based on some criteria
> Is checking that the solution is valid a very fast operation?
That's the NP part in my question. Plenty of scientific problems out there that are fast to verify hard to compute. Ex. Prime Factorization
> Are we sure that there is no "final" answer which would make the calculation unusable at some point?
I would argue, and I might be wrong due to my ignorance on the subject here, that we can never "know" that. That's why P=NP is still an open question
There are no comments on this comment yet.
I am fairly certain you can design your problem to behave in a similar manner or in some manner that increases the complexity based on some criteria
> Is checking that the solution is valid a very fast operation?
That's the NP part in my question. Plenty of scientific problems out there that are fast to verify hard to compute. Ex. Prime Factorization
> Are we sure that there is no "final" answer which would make the calculation unusable at some point?
I would argue, and I might be wrong due to my ignorance on the subject here, that we can never "know" that. That's why P=NP is still an open question