What robots can and can't be

zbMath0825.68034MaRDI QIDQ1189564

Selmer Bringsjord

Publication date: 23 January 1993

Published in: Studies in Cognitive Systems (Search for Journal in Brave)

zbMATH Keywords

robotics

Mathematics Subject Classification ID

Introductory exposition (textbooks, tutorial papers, etc.) pertaining to computer science (68-01) Computing methodologies and applications (68U99)

Related Items (5)

God, souls, and Turing: in defense of the theological objection to the Turing test ⋮ The modal argument for hypercomputing minds ⋮ A new Gödelian argument for hypercomputing minds based on the busy beaver problem ⋮ Searle's abstract argument against strong AI ⋮ Taking Principles Seriously: A Hybrid Approach to Value Alignment in Artificial Intelligence

This page was built for publication: What robots can and can't be