z-logo
open-access-imgOpen Access
Turing Tests with Turing Machines
Author(s) -
José HernándezOrallo,
Javier Insa,
David L. Dowe,
Bill Hibbard
Publication year - 2018
Publication title -
epic series in computing
Language(s) - English
Resource type - Conference proceedings
ISSN - 2398-7340
DOI - 10.29007/9n7d
Subject(s) - turing test , super recursive algorithm , turing , computer science , turing machine examples , universal turing machine , turing machine , non deterministic turing machine , description number , artificial intelligence , perspective (graphical) , theoretical computer science , algorithm , computation , programming language
Comparative tests work by finding the difference (or the absence of difference) between a reference subject and an evaluee. The Turing Test, in its standard interpretation, takes (a subset of) the human species as a reference. Motivated by recent findings and developments in the area of machine intelligence evaluation, we discuss what it would be like to have a Turing Test where the reference and the interrogator subjects are replaced by Turing Machines. This question sets the focus on several issues that are usually disregarded when dealing with the Turing Test, such as the degree of intelligence of reference and interrogator, the role of imitation (and not only prediction) in intelligence, its view from the perspective of game theory and others. Around these issues, this paper finally brings the Turing Test to the realm of Turing machines.

The content you want is available to Zendy users.

Already have an account? Click here to sign in.
Having issues? You can contact us here
Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom