On the connection between the no free lunch theorem and the trivial property for recursively enumerable languages.
VenueBCEC
Year2003
ProceedingsIEEE Congress on Evolutionary Computation
DBLP recordconf/cec/Eberbach03 ↗
Browse the full CEC paper archive.