AI-Complete, AI-Hard, AI-Easy - AI classification
![AI-Complete, AI-Hard, AI-Easy - AI classification](/images/getthumbnail?s=150&u=http%3A%2F%2Flouisville.edu%2Fspeed%2Fcomputer%2Ftr%2FUL_CECS_02_2011.pdf%2Fat_download%2Ffile)
The paper contributes to the development of the theory of AI-Completeness. The intended goalis to provide a classification of problems in the field of Artificial Intelligence with respect to theirsolvability. We prove Turing Test to be an instance of an AI-Complete problem and further show certainAI applications to be AI-Complete or AI-Hard by utilizing polynomial time reductions. Finally, the papersuggests some directions for future work on the theory of AI-Completeness.