Classical AI linguistic understanding and the insoluble Cartesian problem
Keywords: AI; Awareness; Descartes; Meaning; Turing test
Abstract
This paper examines an insoluble Cartesian problem for classical AI, namely, how linguistic understanding involves knowledge and awareness of uâs meaning, a cognitive process that is irreducible to algorithms. As analyzed, Descartesâ view about reason and intelligence has paradoxically encouraged certain classical AI researchers to suppose that linguistic understanding suffices for machine intelligence. Several advocates of the Turing Test, for example, assume that linguistic understanding only comprises computational processes which can be recursively decomposed into algorithmic mechanisms. Against this background, in the first section, I explain Descartesâ view about language and mind. To show that Turing bites the bullet with his imitation game and in the second section I analyze this method to assess intelligence. Then, in the third section, I elaborate on Schank and Abelsonsâ Script Applier Mechanism (SAM, hereby), which supposedly casts doubt on Descartesâ denial that machines can think. Finally, in the fourth section, I explore a challenge that any algorithmic decomposition of linguistic understanding faces. This challenge, I argue, is the core of the Cartesian problem: knowledge and awareness of meaning require a first-person viewpoint which is irreducible to the decomposition of algorithmic mechanisms.
Más información
| Título según SCOPUS: | Classical AI linguistic understanding and the insoluble Cartesian problem |
| Título de la Revista: | AI and Society |
| Volumen: | 35 |
| Número: | 2 |
| Editorial: | Springer Science and Business Media Deutschland GmbH |
| Fecha de publicación: | 2020 |
| Página final: | 450 |
| Idioma: | English |
| DOI: |
10.1007/s00146-019-00906-x |
| Notas: | SCOPUS |