3 ms·
What's neat is the tackling of NP and NP-complete problems that can do better than humans given infinite time and infinite Excel-fu. I wonder about how to go f
by anonsivalley652 7y ago
What's neat is the tackling of NP and NP-complete problems that can do better than humans given infinite time and infinite Excel-fu.
I wonder about how to go further to attack NP-hard problems, like Traveling Salesman, because it maybe that P != NP, and existing approximate holistic solutions lead to suboptimal solutions as anyone using Google Maps knows. At what point do we seriously consider letting AI/ML to do algorithm design itself? (Self-programming systems.)