Another month has passed and here is a new rationality quotes thread. The usual rules are:
- Please post all quotes separately, so that they can be upvoted or downvoted separately. (If they are strongly related, reply to your own comments. If strongly ordered, then go ahead and post them together.)
- Do not quote yourself.
- Do not quote from Less Wrong itself, HPMoR, Eliezer Yudkowsky, or Robin Hanson. If you'd like to revive an old quote from one of those sources, please do so here.
- No more than 5 quotes per person per monthly thread, please.
For the particular problem that comment is discussing (automatic code generation), I suspect that the CS people were describing about a general automatic code generation problem, and the engineers solved a relaxation to that problem which was not in fact intractable.
In general, I don't know how much I like the P-NP distinction. I hear from people who have been in the metaheuristics field for a while that until that became common knowledge, it was basically impossible to get a heuristic published (because you couldn't provably find the optimal solution). But it seems like that distinction leads to an uncanny valley of ignorance, where a lot of people avoid problems that are NP hard instead of looking in their neighborhood for problems that admit polynomial-time algorithms. (For example, instead of "find a tour that is not inferior to any other tour" use "find a good tour" for the TSP.)