Turing Test as a Defining Feature of AI-Completeness
Definition 2: AI-Hard: A problem H is AI-Hard if and only if there is an AIComplete problem C that is polynomial time Turing-reducible to H. Definition 3: AI-Easy: The complexity...
Informacione tehnologije
15 stranica
Informacione tehnologije, Skripte
Objavio studenti.rs
·