4 ms·
"Finding a person who gives a shit about Haskell is an inherently NP-complete computer science problem. It's similar in scope and complexity to the problem of t
by csantini 16y ago
"Finding a person who gives a shit about Haskell is an inherently NP-complete computer science problem. It's similar in scope and complexity to the problem of trying to find a tenured academic who didn't have the bulk of his or her work done by uncredited graduate students."
- prosa 16y agoSurely you could implement this search in at least O(n) time?
- eru 16y agoAt least is easy. At most is hard.
- wahnfrieden 16y ago"At least, if not better." The context disambiguates the direction of magnitude.
- aperiodic 16y agoThat's assuming that you can verify whether or not any given person gives a shit about Haskell in O(1) time.