|
|
|
|
|
|
by tomdre
3019 days ago
|
|
|
This is not a really strong argument against self-driving cars. The fact that a problem is NP-hard doesn't make it untractable. Every day we use apps that deal with NP problems (e.g., routing problems, packing problems, etc.). Also, note that there're P problems whose instances can be harder than (smaller) NP ones. |
|
|