no free lunch theorem
A mathematical optimization concept stating that no single algorithm outperforms all others across all possible problems. Used in machine learning and search theory.
The no free lunch theorem shows that there is no universally best optimization method for all problems.