Since its inception in the 1950s the field of Artificial Intelligence has produced some unparalleled accomplishments while at the same time failing to formalize the problem space it is concerned with. This paper proposes to address this shortcoming by extends on the work in [56] and contributing to the theory of AICompleteness, a formalism designed to do for the field of AI what notion of NP-Completeness did for computer science in general. It is our belief that such formalization will allow for even faster progress in solving remaining problems in humankind’s conquest to build an intelligent machine

Preuzimanje skripti je dozvoljeno samo prijavljenim korisnicima. Registracija je potpuno besplatna!

Prijavi se

Turing Test as a Defining Feature of AI-Completeness

Problemi sa sadržajem

Problemi sa kupovinom i pristupom

Tehnički problemi

Kršenje pravila

Ostalo

Više u Informacione tehnologije

Softversko projektovanje sistema za cvećaru “Cvetić”

Skripta Programiranje na WEBu

Zadatak EXCEL

Više u Skripte

Pesticidi-uticaj na zdravlje ljudi

Reciklaža metala

Zagađenje mora naftom