Skip to main content
main-content

Tipp

Weitere Kapitel dieses Buchs durch Wischen aufrufen

Erschienen in:
Buchtitelbild

2013 | OriginalPaper | Buchkapitel

Turing Test as a Defining Feature of AI-Completeness

verfasst von : Roman V. Yampolskiy

Erschienen in: Artificial Intelligence, Evolutionary Computing and Metaheuristics

Verlag: Springer Berlin Heidelberg

share
TEILEN

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.

Metadaten
Titel
Turing Test as a Defining Feature of AI-Completeness
verfasst von
Roman V. Yampolskiy
Copyright-Jahr
2013
Verlag
Springer Berlin Heidelberg
DOI
https://doi.org/10.1007/978-3-642-29694-9_1

Premium Partner