Difference between revisions of "AI-complete"

From Lesswrongwiki
Jump to: navigation, search
(Created page with "{{wikilink}} A problem is considered '''AI-complete''' or '''AI-hard''' if solving it is equivalent to creating AGI. For example, natural language processing (or machine tran...")
 
Line 1: Line 1:
 
{{wikilink}}
 
{{wikilink}}
A problem is considered '''AI-complete''' or '''AI-hard''' if solving it is equivalent to creating [[AGI]]. For example, natural language processing (or machine translation) is often considered AI-complete because understanding arbitrary language constructs seems to require broad general knowledge. It was coined by the computer scientist Fanya Montalvo as an analogy with NP-complete, a class of problems in [[complexity theory]]. While formalizations have been attempted, the term is usually used to communicate the qualitatively difficulty of a problem.
+
A problem is considered '''AI-complete''' or '''AI-hard''' if solving it is equivalent to creating [[AGI]]. For example, natural language processing (or machine translation) is often considered AI-complete because understanding arbitrary language constructs seems to require broad general knowledge. It was coined by the computer scientist Fanya Montalvo as an analogy with NP-complete, a class of problems in [[complexity theory]]. Problems labeled AI-complete like graceful degradation or computer vision tend to be framed at human-level intelligence; there may be many problems that AIs can solve that humans cannot. While mathematical formalizations of the class have been attempted, the term is usually used to communicate the qualitative difficulty of a problem.
  
 
==See also==
 
==See also==
 
*[[FAI-complete]]
 
*[[FAI-complete]]

Revision as of 06:33, 26 June 2012

Smallwikipedialogo.png
Wikipedia has an article about

A problem is considered AI-complete or AI-hard if solving it is equivalent to creating AGI. For example, natural language processing (or machine translation) is often considered AI-complete because understanding arbitrary language constructs seems to require broad general knowledge. It was coined by the computer scientist Fanya Montalvo as an analogy with NP-complete, a class of problems in complexity theory. Problems labeled AI-complete like graceful degradation or computer vision tend to be framed at human-level intelligence; there may be many problems that AIs can solve that humans cannot. While mathematical formalizations of the class have been attempted, the term is usually used to communicate the qualitative difficulty of a problem.

See also