The (Uncomputable!) Meaning of Ethically Charged Natural Language, for Robots, and Us, from Hypergraphical Inferential Semantics
Author
Bringsjord, Selmer; Hendler, James A.; Govindarajulu, Naveen Sundar; Ghosh, Rikhiya; Giancola, MichaelOther Contributors
Date Issued
2022-09-08Degree
Terms of Use
Attribution-NonCommercial-NoDerivs 3.0 United StatesFull Citation
Bringsjord, Selmer, James Hendler, Naveen Sundar Govindarajulu, Rikhiya Ghosh, and Michael Giancola. "The (Uncomputable!) Meaning of Ethically Charged Natural Language, for Robots, and Us, from Hypergraphical Inferential Semantics." In Towards Trustworthy Artificial Intelligent Systems, pp. 143-167. Springer, Cham, September 2022Metadata
Show full item recordURI
https://hdl.handle.net/20.500.13015/6390; https://link.springer.com/chapter/10.1007/978-3-031-09823-9_11; https://doi.org/10.1007/978-3-031-09823-9_11Abstract
The year is 2030. A two-young-child, two-parent household, the Rubensteins, owns and employs a state-of-the-art household robot, Rodney. With the parents out, the children ask Rodney to perform some action �� that violates a Rubensteinian ethical principle ���� . Rodney replies: (��1 ) “Doing that would be (morally) wrong, kids.” The argument the children give Rodney in protest is that another household, the Müllers, also has a robot, Ralph; and the kids argue that he routinely performs �� . As a matter of fact, Ralph’s doing �� violates no Müllerian ethical principle ���� . Ralph’s response to the very same request from the children he tends is: (��2 ) “Okay, doing that is (morally) fine, kids.” What is the meaning of the utterances made by Rodney and Ralph? We answer this question by presenting and employing a novel, formal, inferential theory of meaning in natural language: hypergraphical inferential semantics (ℋℐ�� ), which is in the general spirit of proof-theoretic semantics, which is in turn antithetical to Montagovian model-theoretic semantics. ℋℐ�� , applied even to sentences logically simpler than ��1 and ��2 , implies that human-level natural language understanding (NLU) is Turing-uncomputable.;Department
Publisher
Springer, ChamRelationships
Access
Collections
The following license files are associated with this item: