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]
@inproceedings{Eberbach03, title = {On the connection between the no free lunch theorem and the trivial property for recursively enumerable languages}, author = {Eugene Eberbach}, year = {2003}, doi = {10.1109/CEC.2003.1299417}, url = {https://doi.org/10.1109/CEC.2003.1299417}, researchr = {https://researchr.org/publication/Eberbach03}, cites = {0}, citedby = {0}, pages = {2611-2618}, booktitle = {Proceedings of the IEEE Congress on Evolutionary Computation, CEC 2003, 8 - 12 December 2003, Canberra, Australia}, publisher = {IEEE}, }