AI-komplit: Perbedaan antara revisi

Istilah AI-komplit ditemukan oleh [[Fanya Montalvo]] dengan analogi pada [[NP-komplit]] dan [[NP-sukar]] dalam [[teori kompleksitas]], yang secara formal menggambarkan kelas paling terkenal dari permasalahan yang sulit.<ref>{{Citation| last=Mallery | first=John C. | year=1988 | url=http://citeseer.ist.psu.edu/mallery88thinking.html | contribution=Thinking About Foreign Policy: Finding an Appropriate Role for Artificially Intelligent Computers | title=The 1988 Annual Meeting of the International Studies Association. | location=St. Louis, MO }}.</ref> Awal penggunaan istilah ini dalam disertasi Erik Mueller tahun 1987<ref>Mueller, Erik T. (1987, March). [ftp://ftp.cs.ucla.edu/tech-report/198_-reports/870017.pdf ''Daydreaming and Computation'' (Technical Report CSD-870017)]{{Pranala mati|date=Januari 2021 |bot=InternetArchiveBot |fix-attempted=yes }} 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.&nbsp;302)</ref> dan [[Berkas Jargon]] [[Eric Raymond]] pada tahun 1991.<ref>Raymond, Eric S. (1991, March 22). [http://catb.org/esr/jargon/oldversions/jarg282.txt Jargon File Version 2.8.1] (Definition of "AI-complete" first added to jargon file.)</ref>