Turing Test as a Defining Feature of AI-Completeness
From MaRDI portal
Publication:2866100
DOI10.1007/978-3-642-29694-9_1zbMath1277.68230OpenAlexW101492982MaRDI QIDQ2866100
Publication date: 13 December 2013
Published in: Studies in Computational Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/978-3-642-29694-9_1
Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) General topics in artificial intelligence (68T01)
Related Items
Cites Work