Intractability (computational complexity theory)


 * 1) clairvoyance → intractability
 * 2) even with complete foreknowledge, finding the perfect schedule might be practically impossible
 * 3) what about partial clairvoyance (half-life)?
 * 4) Moore's algorithm minimizes the number of late tasks (or rotten fruits) when they’re all of equal value—but if some are more important than others, the problem becomes intractable and no algorithm can readily provide the optimal schedule

Related

 * 1) wicked problem
 * 2) nonlinear partial differential equation