AI-Complete, AI-Hard, or AI-Easy - Classification of Problems in AI

Abstract

The paper contributes to the development of the theory of AI-Completeness by formalizing the notion of AIComplete and AI-Hard problems. The intended goal is to provide a classification of problems in the field of General Artificial Intelligence. We prove Turing Test to be an instance of an AI-Complete problem and further show numerous 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. KeywordsAI-Complete, AI-Easy, AI-Hard, Human

Extracted Key Phrases

3 Figures and Tables

Cite this paper

@inproceedings{Yampolskiy2012AICompleteAO, title={AI-Complete, AI-Hard, or AI-Easy - Classification of Problems in AI}, author={Roman V. Yampolskiy}, booktitle={MAICS}, year={2012} }