 Therefore, compiler writers will always be able to speculate that they have something to improve.A similar example in practical computer science is the idea of no free lunch in search and optimization, which states that no efficient general-purpose solver can exist, and hence there will always be some particular problem whose best known solution might be improved.Similarly, Gödel's incompleteness theorems have been called full employment theorems for mathematicians.