3 ms·

lol so says every person that has no clue how (NP-hard) combinatorial optimization is.

• benchmarkist 2y ago
  For humans it's very hard but it will be a breeze for the AI. I thought HN was a community of builders. This is an obvious startup opportunity.
  • stouset 2y ago
    All we have to do is ascribe magical properties to AI and we can solve anything as if P=NP!
    • benchmarkist 2y ago
      Those distinction are irrelevant for an AI because it is a pure form of intelligence that simply computes answers without worrying about P or NP complexity classes.
      • ConspiracyFact 2y ago
        You had me going. B-
      • imtringued 2y ago
        That's the same as being confidently wrong.