Indeed, many incompleteness results (the most famous being the Halting Problem) are known as "infinite employment theorems". For example, we can always make a c

Indeed, many incompleteness results (the most famous being the Halting Problem) are known as "infinite employment theorems". For example, we can always make a compiler perform more optimisations as follows: 1) Every diverging (non-terminating, non-co-terminating) program can be optimised to the following: 10 GOTO 10 2) The Halting Problem tells us that no compiler can spot every diverging program. 3) Hence there is room for more optimisation, by spotting more diverging programs. 4) Hence there is always more work to do for compiler developers.