Английская Википедия:AI-complete

Содержание

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Текст

Шаблон:Short description 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, assuming intelligence is computational, is equivalent to that of solving the central artificial intelligence problem—making computers as intelligent as people, or strong AI. 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.

Currently, AI-complete problems cannot be solved with modern computer technology alone, but would also require human computation. This property could be useful, for example, to test for the presence of humans as CAPTCHAs aim to do, and for computer security to circumvent brute-force attacks.

History

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. Early uses of the term are in Erik Mueller's 1987 PhD dissertation and in Eric Raymond's 1991 Jargon File.

AI-complete problems

AI-complete problems are hypothesized to include:

• AI peer review (composite natural language understanding, automated reasoning, automated theorem proving, formalized logic expert system)
• Bongard problemsШаблон:Citation needed
• Computer vision (and subproblems such as object recognition)
• Natural language understanding (and subproblems such as text mining, machine translation, and word-sense disambiguation)
• Autonomous driving
• Dealing with unexpected circumstances while solving any real world problem, whether it's navigation or planning or even the kind of reasoning done by expert systems.Шаблон:Citation needed

Software brittleness

Шаблон:Main Current AI systems can solve very simple and/or 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.

DeepMind published a work in May 2022 in which they trained a single model to do several things at the same time. The model, named Gato, can "play Atari, caption images, chat, stack blocks with a real robot arm and much more, deciding based on its context whether to output text, joint torques, button presses, or other tokens."

Formalization

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. 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 <math>\langle\Phi_{H},\Phi_{M}\rangle</math>, 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

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

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

See also

• ASR-complete
• List of unsolved problems in computer science
• Synthetic intelligence
• Practopoiesis