Hacker News Reader

I love that I can now just drop the link to this gem:

https://dl.acm.org/doi/10.1145/1165555.1165556

Aggregability is NP-Hard... Useful the next time someone insists that it's possible to find a "perfect" model for a non-trivial ML problem. (I get this ask 1-2 times per month.)

(As others have said, it's probably better to choose the doi.org URL over the dl.acm.org one in general. Three cheers for HOPL!)

Where is HOPL I? Could only find this: https://dl.acm.org/toc/sigplan/1978/13/8

The HOPL (1) book (ISBN 9780127450407 ) is at https://doi.org/10.1145/800025 (direct link to ACM: https://dl.acm.org/doi/book/10.1145/800025 ) .

OK, I made a post about it.

Ask HN: Favorite Articles in the ACM Digital Library - https://news.ycombinator.com/item?id=46460953