Sign in

On the connection between the no free lunch theorem and the trivial property for recursively enumerable languages.

Eugene Eberbach
Published in: IEEE Congress on Evolutionary Computation (2003)
Keyphrases
  • recursively enumerable
  • inductive inference
  • recursive functions
  • hypothesis space
  • real valued functions
  • monadic datalog
  • learning machines
  • data sets
  • machine learning
  • feature selection
  • e learning
  • training data