On the connection between the no free lunch theorem and the trivial property for recursively enumerable languages | IEEE Conference Publication | IEEE Xplore