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. Read more
![Directory](/design/header/tab_directory_off.png)
![Business](/design/header/tab_business_off.png)
![Research](/design/header/tab_research_on.png)
![Awards](/design/header/tab_awards_off.png)
![Community](/design/header/tab_community_off.png)
![Forums](/design/header/tab_forums_off.png)