Chapter

Artificial Intelligence, Evolutionary Computing and Metaheuristics

Volume 427 of the series Studies in Computational Intelligence pp 3-17

Turing Test as a Defining Feature of AI-Completeness

  • Roman V. YampolskiyAffiliated withComputer Engineering and Computer Science, University of Louisville Email author 

* Final gross prices may vary according to local VAT.

Get Access

Abstract

The paper contributes to the development of the theory of AI-Completeness by formalizing the notion of AI-Complete, C-Complete and AI-Hard problems. The intended goal is to provide a classification of problems in the field of Artificial General Intelligence. We prove Turing Test to be an instance of an AI-Complete problem and further show certain AI problems to be AI-Complete or AI-Hard via polynomial time reductions. Finally, the paper suggests some directions for future work on the theory of AI-Completeness.

Keywords

AI-Complete AI-Easy AI-Hard Human Oracle