Tests of Machine Intelligence

Although the definition and measurement of intelligence is clearly of fundamental importance to the field of artificial intelligence, no general survey of definitions and tests of machine intelligence exists. Indeed few researchers are even aware of alternatives to the Turing test and its many derivatives. In this paper we fill this gap by providing a short survey of the many tests of machine intelligence that have been proposed.

[1]  Varol Akman,et al.  Turing Test: 50 Years Later , 2000, Minds and Machines.

[2]  Warren D. Smith.  Mathematical definition of"intelligence"(and consequences) , 2006 .

[3]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[4]  William I. Gasarch,et al.  Book Review: An introduction to Kolmogorov Complexity and its Applications Second Edition, 1997 by Ming Li and Paul Vitanyi (Springer (Graduate Text Series)) , 1997, SIGACT News.

[5]  S. Watt.  Naive psychology and the inverted Turing test , 1996 .

[6]  Steffen Christensen,et al.  The Turing Ratio: Metrics For Open-ended Tasks , 2002, GECCO.

[7]  David L. Dowe,et al.  A Non-Behavioural, Computational Extension to the Turing Test , 1998 .

[8]  Jason Hutchens,et al.  How to Pass the Turing Test by Cheating , 1997 .

[9]  AnatTreister-Goren TrainingDepartment,et al.  Creating AI : A Unique Interplay Between the Development of Learning Algorithms and their Education , 2001 .

[10]  A. M. Turing,et al.  Computing Machinery and Intelligence , 1950, The Philosophy of Artificial Intelligence.

[11]  John R. Searle,et al.  Minds, brains, and programs , 1980, Behavioral and Brain Sciences.

[12]  S. S. Adams,et al.  Beyond the Turing test: performance metrics for evaluating a computer simulation of the human mind , 2002, Proceedings 2nd International Conference on Development and Learning. ICDL 2002.

[13]  Marcus Hutter,et al.  Universal Artificial Intellegence - Sequential Decisions Based on Algorithmic Probability , 2005, Texts in Theoretical Computer Science. An EATCS Series.

[14]  Shane Legg,et al.  A Formal Measure of Machine Intelligence , 2006, ArXiv.

[15]  S. Shieber.  Subcognition and the Limits of the Turing Test , 2004 .

[16]  N. Block.  Psychologism and Behaviorism , 1981 .

[17]  R. French.  Subcognition and the Limits of the TuringTest , 1990 .

[18]  Shane Legg,et al.  A Collection of Definitions of Intelligence , 2007, AGI.

[19]  David L. Dowe,et al.  A computer program capable of passing I.Q. tests , 2008 .

[20]  Selmer Bringsjord,et al.  What is Artificial Intelligence? Psychometric AI as an Answer , 2003, IJCAI.

[21]  Stuart M. Shieber,et al.  Lessons from a restricted Turing test , 1994, CACM.

[22]  L. Gottfredson.  Why g matters: The complexity of everyday life , 1997 .

[23]  Paul Schweizer,et al.  The Truly Total Turing Test* , 1998, Minds and Machines.

[24]  Jason L. Hutchens,et al.  The Developmental Approach to Evaluating Artificial Intelligence — A Proposal , 2000 .

[25]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[26]  Stevan Harnad,et al.  Minds, machines and Searle , 1989, J. Exp. Theor. Artif. Intell..

[27]  Matthew V. Mahoney,et al.  Text Compression as a Test for Artificial Intelligence , 1999, AAAI/IAAI.

[28]  G. Chaitin.  Gödel's theorem and information , 1982 .