Servicios Personalizados
Revista
Articulo
Indicadores
Citado por SciELO
Accesos
Links relacionados
Similares en
SciELO
Compartir
Sophia, Colección de Filosofía de la Educación
versión On-line ISSN 1390-8626versión impresa ISSN 1390-3861
Resumen
GONZALEZ FERNANDEZ, Rodrigo Alfonso. The Feasibility of Turing’s Child-Machine. Sophia [online]. 2025, n.39, pp.115-139. ISSN 1390-8626. https://doi.org/10.17163/soph.n39.2025.03.
According to the philosophers of Artificial Intelligence (AI), Turing Machines and the Imitation Game are the most important concepts proposed by Alan Turing. The Child-Machine Project, which projects learning machines via digital computers, is less known, although it is no less important. According to Turing’s project, a programmed machine needs to be a Child-Machine to turn into an adult mind, one that understands, judges, and distinguishes. In this article, I argue that Turing’s desideratum is not realizable only with algorithms. In the first section, I introduce the problem, while in the second I briefly analyze concepts such as algorithms, Turing Machines, and their relation. In the third section, I deal with Machine Intelligence and the Child-Machine Project. In the fourth section, I look at a form of understanding, which is the basis of the Chinese Room Argument: introspection and reflective thinking, two factors that enable the process by which results are revised. In the fifth section, I analyze why those processes of revision are the stumbling block of classical AI or GOFAI; as I argue, introspection and reflective thinking are the cognitive faculties that prevent the child-machine from becoming a “thinking adult mind”.
Palabras clave : Child-Machine; Thinking Adult Mind; Turing Machines; Algorithms; Introspection; Machine Intelligence..











