Rating is available when the video has been rented.
This feature is not available right now. Please try again later.
Published on Jan 3, 2013
Abstract: The Turing Test, in its standard interpretation, has been dismissed by many as a practical intelligence test. In fact, it is questionable that the imitation game was meant by Turing himself to be used as a test for evaluating machines and measuring the progress of artiﬁcial intelligence. In the past ﬁfteen years or so, an alternative approach to measuring machine intelligence has been consolidating. The key concept for this alternative approach is not the Turing Test, but the Turing machine, and some theories derived upon it, such as Solomonoff’s theory of prediction, the MML principle, Kolmogorov complexity and algorithmic information theory. This presents an antagonistic view to the Turing test, where intelligence tests are based on formal principles, are not anthropocentric, are meaningful computationally and the abilities (or factors) which are evaluated can be recognised and quantiﬁed. Recently, however, this computational view has been touching upon issues which are somewhat related to the Turing Test, namely that we may need other intelligent agents in the tests. Motivated by these issues (and others), this paper links these two antagonistic views by bringing some of the ideas around the Turing Test to the realm of Turing machines. Paper: Turing Machines and Recursive Turing Tests by Jose Hernandez-Orallo, Javier Insa-Cabrera, David L. Dowe and Bill Hibbard