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

Theoretical Computer Science(2019)

引用 3|浏览20
暂无评分
摘要
Question-answering systems like Watson beat humans when it comes to processing speed and memory. But what happens if we compensate for this? What are the fundamental differences in power between human and artificial agents in question answering? We explore this issue by defining new computational models for both agents and comparing their computational efficiency in interactive sessions.
更多
查看译文
关键词
Question answering,Computational complexity,Human agents,Cognitive automata,Background intelligence,QA-machines,Advice,Learning space,Pippenger's theorem,Turing machines
AI 理解论文
溯源树
样例
生成溯源树,研究论文发展脉络
Chat Paper
正在生成论文摘要