<abstract xml:lang="en" xmlns="http://www.w3.org/1999/xhtml"><p>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.</p></abstract>

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.

Bias and No Free Lunch in Formal Measures of Intelligence

University of Wisconsin - Madison, 1225 West Dayton Street, Madison, WI 53706

Journal of Artificial General Intelligence

{"article-title":"Bias and No Free Lunch in Formal Measures of Intelligence"}

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...

Bias and No Free Lunch in Formal Measures of Intelligence

Online veröffentlicht: 23. Nov. 2011

Seitenbereich: 54 - 61

DOI: https://doi.org/10.2478/v10229-011-0004-6

Schlüsselwörter
Kolmogorov complexity, no free lunch theorem

This content is open access.

Bias and No Free Lunch in Formal Measures of Intelligence

Online veröffentlicht: 23. Nov. 2011

Seitenbereich: 54 - 61

DOI: https://doi.org/10.2478/v10229-011-0004-6

SchlüsselwörterKolmogorov complexity, no free lunch theorem

This content is open access.

Schlüsselwörter
Kolmogorov complexity, no free lunch theorem