| 翻訳と辞書 |
AI-complete
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.〔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".)〕 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.〔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〕
Currently, AI-complete problems cannot be solved with modern computer technology alone, but would 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.〔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.〕〔 (unpublished?)〕
==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 Ph.D. dissertation〔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)〕 and in Eric Raymond's 1991 Jargon File.〔Raymond, Eric S. (1991, March 22). (Jargon File Version 2.8.1 ) (Definition of "AI-complete" first added to jargon file.)〕
抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』
■ウィキペディアで「AI-complete」の詳細全文を読む
スポンサード リンク
| 翻訳と辞書 : 翻訳のためのインターネットリソース |
Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.
|
|