While this definition is mathematically correct, the examples are not quite typical "greedy" optimization problems. They are often better described as caching or incremental processing Sprunki. It is helpful to clarify what the locally optimal solution is in these cases: In File Scan, the locally optimal choice is "Skip file" if the file timestamp has not changed. This is not about maximizing value, but about minimizing work.