AI-completeness: using deep learning to eliminate the human factor

DOI10.1007/978-3-030-37591-1_11MaRDI QIDQ3296993zbMATH OpenOpenAlexFDO

Authors Kristina Šekrst

Publication date 2 July 2020

Published in Guide to Deep Learning Basics (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1007/978-3-030-37591-1_11

Mathematics Subject Classification ID

Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17) General topics in artificial intelligence (68T01) Artificial neural networks and deep learning (68T07)

Recommendations

• Turing test as a defining feature of AI-completeness
• scientific article; zbMATH DE number 1531968
• scientific article; zbMATH DE number 872161
• scientific article; zbMATH DE number 4076613
• Computational intelligence: foundations, perspectives, and recent trends

Cites work

• Computational Complexity
• Fast multiplication of large numbers
• scientific article; zbMATH DE number 1042857 (Why is no real title available?)
• scientific article; zbMATH DE number 2009963 (Why is no real title available?)
• Turing test as a defining feature of AI-completeness

Cited in

(2)

• Turing test as a defining feature of AI-completeness
• AI, visual imagery, and a case study on the challenges posed by human intelligence tests

This page was built for publication: AI-completeness: using deep learning to eliminate the human factor

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3296993)