Question answering by humans and machines: a complexity-theoretic view

DOI10.1016/j.tcs.2018.08.012zbMath1423.68375OpenAlexW2887740743WikidataQ129401232 ScholiaQ129401232MaRDI QIDQ2422044

Jan van Leeuwen, Juraj Wiedermann

Publication date: 18 June 2019

Published in: Theoretical Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1016/j.tcs.2018.08.012

zbMATH Keywords

computational complexityTuring machinesadvicequestion answeringlearning spacebackground intelligencecognitive automatahuman agentsPippenger's theoremQA-machines

Mathematics Subject Classification ID

Analysis of algorithms and problem complexity (68Q25) General topics in artificial intelligence (68T01)

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Turing machines, transition systems, and interaction
• Turing machines that take advice
• Automata that take advice
• Persistent Computations of Turing Machines
• The computational limits to the cognitive power of the neuroidal tabula rasa

This page was built for publication: Question answering by humans and machines: a complexity-theoretic view