Turing test as a defining feature of AI-completeness (Q2866100)
From MaRDI portal
!
This is the item page for this Wikibase entity, intended for internal use and editing purposes. Please use the normal view instead:
scientific article; zbMATH DE number 6237906
| Language | Label | Description | Also known as |
|---|---|---|---|
| default for all languages | No label defined |
||
| English | Turing test as a defining feature of AI-completeness |
scientific article; zbMATH DE number 6237906 |
Statements
Turing Test as a Defining Feature of AI-Completeness (English)
0 references
13 December 2013
0 references
AI-complete
0 references
AI-easy
0 references
AI-hard
0 references
human oracle
0 references
0.7518835067749023
0 references
0.7268946766853333
0 references
0.6981582641601562
0 references
0.6938482522964478
0 references
0.6892475485801697
0 references
