Hacker Newsnew | past | comments | ask | show | jobs | submitlogin

If you didn't read the paper, at least read the title: "unsolvable" does not mean NP hard


I did read the paper (now). Their question is of “learnability”, which relates to aggregability/compressibility and dimensionality.

This stuff is all in the same ballpark.

Having read their paper, I do appreciate the formulation and approach. I just don’t find the result “surprising” in the slightest.




Guidelines | FAQ | Lists | API | Security | Legal | Apply to YC | Contact

Search: