4 ms·
In addition, you need a problem that is hard to solve but quick to verify. I reckon most useful problems would not be quick to verify.
by quickthrower2 9y ago
In addition, you need a problem that is hard to solve but quick to verify. I reckon most useful problems would not be quick to verify.
- ben_w 9y agoMy gut feeling says a set of open AI challenges, where the work is “train to solve this with accuracy > $difficultyParameter”, and the proof is something that both tests the accuracy of the work, and (if this idea is even possible) demonstrates that it wasn’t over-fitting/memorising.
- amelius 9y agoNP complete problems are hard to solve but can be verified in polynomial time. There are many useful problems in this class. (Of course here hard to solve would mean in the "worst case", which may not hold for every problem instance).