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.
Cite
CITATION STYLE
APA
Hibbard, B. (2011). Bias and No Free Lunch in Formal Measures of Intelligence. Journal of Artificial General Intelligence, 1(1), 54–61. https://doi.org/10.2478/v10229-011-0004-6
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
Already have an account? Sign in
Sign up for free