The notion of algorithmic complexity was developed by Kolmogorov (1965) and Chaitin (1966) independently of one another and of Solomonoff’s notion (1964) of algorithmic probability. Given a Turing… (More)

Minimum Message Length (MML) is an invariant Bayesian point estimation technique which is also statistically consistent and efficient. We provide a brief overview of MML inductive inference (Wallace… (More)

We provide a brief overviewo fM inimum Message Length (MML) inductive inference (Wallace and Boulton (1968), Wallace and Freeman (1987)). We then outline howMML is used for statistical parameter… (More)

In this paper, we develop the idea of a universal anytime intelligence test. The meaning of the terms “universal” and “anytime” is manifold here: the test should be able to measure the intelligence… (More)

The Imitation Game (Alan M. Turing, 1950), now commonly known as the Turing Test (see, e.g., Oppy and Dowe, http://plato.stanford.edu/entries/turing-test, 2003), was proposed as a way in which… (More)

Comprehensive data on the developmental history and current behaviours of a large sample of high-functioning individuals with diagnoses of autism, Asperger's syndrome, or other related disorder were… (More)

Search engines and indices were created to help people find information amongst the rapidly increasing nutnber of World Wide Web (WWW) pages. The search engines automatically visit and index pages so… (More)

We study the notion of universality probability of a universal prefix-free machine, as introduced by C. S. Wallace. We show that it is random relative to the third iterate of the halting problem and… (More)