Robin Z: the context was the feasibility of AI. We do not have infinite resources, and if P != NP, algorithms for NP-hard problems do not feasibly scale. Mathematically, the travelling salesman can be exactly solved in exponential time. Physically, exponential time is not available. Neither is exponential space, so parallelism doesn’t help.
Robin Z: the context was the feasibility of AI. We do not have infinite resources, and if P != NP, algorithms for NP-hard problems do not feasibly scale. Mathematically, the travelling salesman can be exactly solved in exponential time. Physically, exponential time is not available. Neither is exponential space, so parallelism doesn’t help.