Turing Test as a Defining Feature of AI-Completeness (Q2866100): Difference between revisions
From MaRDI portal
Created a new Item |
ReferenceBot (talk | contribs) Changed an Item |
||
(3 intermediate revisions by 3 users not shown) | |||
Property / MaRDI profile type | |||
Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
Property / full work available at URL | |||
Property / full work available at URL: https://doi.org/10.1007/978-3-642-29694-9_1 / rank | |||
Normal rank | |||
Property / OpenAlex ID | |||
Property / OpenAlex ID: W101492982 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Q4434882 / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Financial Cryptography and Data Security / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: Reducibility among Combinatorial Problems / rank | |||
Normal rank | |||
Property / cites work | |||
Property / cites work: <i>The Turing Test as Interactive Proof</i> / rank | |||
Normal rank | |||
links / mardi / name | links / mardi / name | ||
Latest revision as of 04:32, 7 July 2024
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Turing Test as a Defining Feature of AI-Completeness |
scientific article |
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