Acerca de este artículo
Publicado en línea: 23 nov 2011
Páginas: 54 - 61
DOI: https://doi.org/10.2478/v10229-011-0004-6
Palabras clave
This content is open access.
This paper shows that a constraint on universal Turing machines is necessary for Legg's and Hutter's formal measure of intelligence to be unbiased. Their measure, defined in terms of Turing machines, is adapted to finite state machines. A No Free Lunch result is proved for the finite version of the measure.