Buscar
Mostrando ítems 21-30 de 193
Non-standard numbers: a semantic obstacle for modelling arithmetical reasoning
(Oxford Univ PressOxfordInglaterra, 2012)
State emphasis for 2,3 turing machine 596440
(Wolfram Demonstrations Project, 2016)
State emphasis for 2,3 turing machine 596440
(Wolfram Demonstrations Project, 2011)
Classical AI linguistic understanding and the insoluble Cartesian problem
(Springer London, 2020)
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, ...
Classical AI linguistic understanding and the insoluble Cartesian problem
(Springer, 2020)
This paper examines an insoluble Cartesian problem for classical AI, namely, how linguistic understanding involves knowledge and awareness ofu'smeaning, a cognitive process that is irreducible to algorithms. As analyzed, ...
El test de turing: dos mitos, un dogma
(Universidad de Chile, Facultad de Filosofía y Humanidades, 2007)
Este artículo analiza el Test de Turing, uno de los métodos más famosos y
controvertidos para evaluar la existencia de vida mental en la Filosofía de la
Mente, revelando dos mitos filosóficos comúnmente aceptados y ...