AI-complete

From Wikipedia, the free encyclopedia
Jump to: navigation, search

In the field of artificial intelligence, the most difficult problems are informally known as AI-complete or AI-hard, implying that the difficulty of these computational problems is equivalent to that of solving the central artificial intelligence problem—making computers as intelligent as people, or strong AI.[1] To call a problem AI-complete reflects an attitude that it would not be solved by a simple specific algorithm.

AI-complete problems are hypothesised to include computer vision, natural language understanding, and dealing with unexpected circumstances while solving any real world problem.[2]

With current technology, AI-complete problems cannot be solved by computer alone, but also require human computation. This property can be useful, for instance to test for the presence of humans as with CAPTCHAs, and for computer security to circumvent brute-force attacks.[3][4]

History[edit]

The term was coined by Fanya Montalvo by analogy with NP-complete and NP-hard in complexity theory, which formally describes the most famous class of difficult problems.[5] Early uses of the term are in Erik Mueller's 1987 Ph.D. dissertation[6] and in Eric Raymond's 1991 Jargon File.[7]

AI-complete problems[edit]

AI-complete problems are hypothesised to include:

Machine translation[edit]

To translate accurately, a machine must be able to understand the text. It must be able to follow the author's argument, so it must have some ability to reason. It must have extensive world knowledge so that it knows what is being discussed — it must at least be familiar with all the same commonsense facts that the average human translator knows. Some of this knowledge is in the form of facts that can be explicitly represented, but some knowledge is unconscious and closely tied to the human body: for example, the machine may need to understand how an ocean makes one feel to accurately translate a specific metaphor in the text. It must also model the authors' goals, intentions, and emotional states to accurately reproduce them in a new language. In short, the machine is required to have wide variety of human intellectual skills, including reason, commonsense knowledge and the intuitions that underlie motion and manipulation, perception, and social intelligence. Machine translation, therefore, is believed to be AI-complete: it may require strong AI to be done as well as humans can do it.

Software brittleness[edit]

Current AI systems can solve very simple restricted versions of AI-complete problems, but never in their full generality. When AI researchers attempt to "scale up" their systems to handle more complicated, real world situations, the programs tend to become excessively brittle without commonsense knowledge or a rudimentary understanding of the situation: they fail as unexpected circumstances outside of its original problem context begin to appear. When human beings are dealing with new situations in the world, they are helped immensely by the fact that they know what to expect: they know what all things around them are, why they are there, what they are likely to do and so on. They can recognize unusual situations and adjust accordingly. A machine without strong AI has no other skills to fall back on.[8]

Formalization[edit]

Computational complexity theory deals with the relative computational difficulty of computable functions. By definition it does not cover problems whose solution is unknown or has not been characterised formally. Since many AI problems have no formalisation yet, conventional complexity theory does not allow the definition of AI-completeness.

To address this problem, a complexity theory for AI has been proposed.[9] It is based on a model of computation that splits the computational burden between a computer and a human: one part is solved by computer and the other part solved by human. This is formalised by a human-assisted Turing machine. The formalisation defines algorithm complexity, problem complexity and reducibility which in turn allows equivalence classes to be defined.

The complexity of executing an algorithm with a human-assisted Turing machine is given by a pair \langle\Phi_{H},\Phi_{M}\rangle, where the first element represents the complexity of the human's part and the second element is the complexity of the machine's part.

Results[edit]

The complexity of solving the following problems with a human-assisted Turing machine is:[9]

  • Optical character recognition for printed text: \langle O(1), poly(n) \rangle
  • Turing test:
    • for an n-sentence conversation where the oracle remembers the conversation history (persistent oracle): \langle O(n), O(n) \rangle
    • for an n-sentence conversation where the conversation history must be retransmitted: \langle O(n), O(n^2) \rangle
    • for an n-sentence conversation where the conversation history must be retransmitted and the person takes linear time to read the query: \langle O(n^2), O(n^2) \rangle
  • ESP game: \langle O(n), O(n) \rangle
  • Image labelling (based on the Arthur–Merlin protocol): \langle O(n), O(n) \rangle
  • Image classification: human only: \langle O(n), O(n) \rangle , and with less reliance on the human: \langle O(\log n), O(n \log n) \rangle .

See also[edit]

References[edit]

  1. ^ Shapiro, Stuart C. (1992). Artificial Intelligence In Stuart C. Shapiro (Ed.), Encyclopedia of Artificial Intelligence (Second Edition, pp. 54–57). New York: John Wiley. (Section 4 is on "AI-Complete Tasks".)
  2. ^ Roman V. Yampolskiy. Turing Test as a Defining Feature of AI-Completeness . In Artificial Intelligence, Evolutionary Computation and Metaheuristics (AIECM) --In the footsteps of Alan Turing. Xin-She Yang (Ed.). pp. 3-17. (Chapter 1). Springer, London. 2013. http://cecs.louisville.edu/ry/TuringTestasaDefiningFeature04270003.pdf
  3. ^ Luis von Ahn, Manuel Blum, Nicholas Hopper, and John Langford. CAPTCHA: Using Hard AI Problems for Security. In Proceedings of Eurocrypt, Vol. 2656 (2003), pp. 294-311.
  4. ^ Bergmair, Richard (January 7, 2006). Natural Language Steganography and an "AI-complete" Security Primitive. CiteSeerX: 10.1.1.105.129.  (unpublished?)
  5. ^ Mallery, John C. (1988), "Thinking About Foreign Policy: Finding an Appropriate Role for Artificially Intelligent Computers", The 1988 Annual Meeting of the International Studies Association., St. Louis, MO .
  6. ^ Mueller, Erik T. (1987, March). Daydreaming and Computation (Technical Report CSD-870017) Ph.D. dissertation, University of California, Los Angeles. ("Daydreaming is but one more AI-complete problem: if we could solve any one artificial intelligence problem, we could solve all the others", p. 302)
  7. ^ Raymond, Eric S. (1991, March 22). Jargon File Version 2.8.1 (Definition of "AI-complete" first added to jargon file.)
  8. ^ Lenat, Douglas; Guha, R. V. (1989), Building Large Knowledge-Based Systems, Addison-Wesley, pp. 1–5 
  9. ^ a b Dafna Shahaf and Eyal Amir (2007) Towards a theory of AI completeness. Commonsense 2007, 8th International Symposium on Logical Formalizations of Commonsense Reasoning.