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

DOI10.1007/978-3-030-37591-1_11zbMATH Open1446.68136OpenAlexW3000860302MaRDI QIDQ3296993FDOQ3296993

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

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

Mathematics Subject Classification ID

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

Cites Work

• Computational Complexity
• Fast multiplication of large numbers
• Title not available (Why is that?)
• Title not available (Why is that?)
• 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)