Eugene Eberbach. On the connection between the no free lunch theorem and the trivial property for recursively enumerable languages. In Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2003, 8 - 12 December 2003, Canberra, Australia. pages 2611-2618, IEEE, 2003. [doi]
Abstract is missing.