Ambivalencia en la inteligencia de la máquina: las raíces epistemológicas de la máquina de Turing
Resumen
La Máquina de Turing (TM) se presenta como el hito y el diseño inicial de un autómata digital presente en todas las computadoras digitales modernas de propósito general y cuyo diseño en números computables establece bases profundamente ontológicas y epistemológicas para las computadoras de hoy. Estas líneas de trabajo intentan analizar brevemente el problema epistemológico fundamental que surgió a finales del siglo XIX y principios del XX mediante el cual emerge la “cognición de la máquina”. Las raíces epistemológicas que se abordan en la TM y, en particular, en su “Problema de detención” ponen al descubierto la tensión entre el determinismo y la incertidumbre, consideradas aquí, como las características primordiales e inherentes de la cognición de la máquina.Descargas
Citas
Bach, Joscha (2020), “Artificial Consciousness and the Nature of Reality | Lex Fridman Podcast #101”, en Lex Fridman, June 13th, available on: [https://youtu.be/P-2P3MSZrBM&t=622s], accessed:
Bardin, Andrea (2015), Epistemology and Political Philosophy in Gilbert Simondon, London, Springer.
Blanco, Javier (2014), “Pensar y calcular”, Nombres. Revista de Filosofía, no. 28, pp. 213-229.
Blanco, Javier (2013), “Una máquina que puede hacer todo”, Página 12, April 17th, available on: [https://www.pagina12.com.ar/diario/ciencia/19-218171-2013-04-17.html], accessed:
Blanco, Javier, Diego Parente, Pablo Rodríguez y Andrés Vaccari (coords.) (2015), Amar a las máquinas. Cultura y técnica en Gilbert Simondon, Buenos Aires, Prometeo.
Boole, George (2017 [c. 1854]), An Investigation of the Laws of Thought, in Project Gutenberg’s, available on: [https://www.gutenberg.org/files/15114/15114-pdf.pdf], accessed:
Borges, Jorge Luis (1974 [c. 1964]), “Buenos Aires”, in Obras completas de Jorge Luis Borges”, Buenos Aires, Emecé Editoriales, p. 946.
Cantor, Georg (1874), “Ueber eine Eigenschaft des Inbegriffes aller reellen algebraischen Zahlen”, Journal für die Reine und Angewandte Mathematik, vol. 77, pp. 258-262, available on: [http://www.digizeitschriften.de/main/dms/img/?PPN=GDZPPN002155583], accessed:
Copeland, B. Jack (2020), “The Church-Turing Thesis”, in Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy, Summer Edition, available on [https://plato.stanford.edu/archives/sum2020/entries/church-turing/], accessed:
Davis, Martin (2018), The Universal Computer: The road from Leibniz to Turing, New York, CRC Press Taylor & Francis Group.
Dennett, Daniel (2017), From Bacteria to Bach and back: The Evolution of Minds, New York, Penguin Books.
Dyson, George (2012a), “The dawn of computing”, Nature, vol. 482, pp. 459-460. [https://doi.org/10.1038/482459a]
Dyson, George (2012b), Turing’s Cathedral: The Origins of the Digital Universe, New York, Pantheon Books.
Frege, Gottlob (1993), Logische Untersuchungen, Göttingen, Vandenhoeck und Ruprecht Signatur.
Frege, Gottlob (1988 [c. 1884]), Die Grundlagen der Arithmetik, Hamburg, Felix Meiner Verlag GmbH.
Galileo, Galilei (1960), “The Assayer”, in Galileo Galilei, Horatio Grassi, Mario Guiducci and Johann Kepler, The Controversy on the Comets of 1618, Philadelphia, University of Pennsylvania Press, pp. 151-336.
Gödel, Kurt (2006), “Über formal unentscheidbare Sätze der Principia Mathematica und verwandter Systeme I”, Monatshefte für Mathematik, vol. 149, pp. 1-29. [https://doi.org/10.1007/s00605-006-0423-7]
Haugeland, John (1985), Artificial Intelligence: The Very Idea, Cambridge, Massachusetts/London/England, The MIT Press.
Hilbert, David and Wilhelm Ackermann (1928), Grundzüge der theoretischen Logik, Berlin, Springer.
Hodges, Andrew (1992), Alan Turing: The Enigma, London, Vintage.
Hofstadter, Douglas (1994 [c. 1979]), Gödel, Escher, Bach: An Eternal Golden Braid, New York, Basic Books.
Hörl, Erich (2018), Sacred Channels: The Archaic Illusion of Communication, Amsterdam, Amsterdam University Press.
Lucas, John Randolph (2003), “Minds, machines and Gödel”, Etica E Politica, vol. 5, no. 1, p. 1.
Nagel, Ernest and James R. Newman, (1958), Gödel’s Proof, New Yotk, Routledge.
Newell Allen and Simon Herbert Alexander (1976), “Computer science as empirical inquiry: Symbols and search”, Communications of the ACM, vol. 19, pp. 113-126.
Ortega y Gasset, José (1958), La idea de principio en Leibniz y la evolución de la teoría deductiva, Buenos Aires, Revista de Occidente/Emecé.
Pearl, Judea (1988), Probabilistic Reasoning in Intelligent Systems: Networks of Plausible Inference, San Francisco, Morgan Kaufmann Publishers Inc.
Penrose, Roger (1994), Shadows of the Mind, New York, Oxford University Press.
Penrose, Roger (1989), The Emperor’s New Mind, New York, Oxford University Press.
Petzold, Charles (2008), The Annotated Turing. A Guided Tour through Alan Turing’s Historic Paper on Computability and the Turing Machine, Indianapolis, Wiley Publishing Inc.
Post, Emil (1947), “Recursive unsolvability of a problem of Thue”, Journal of Symbolic Logic, vol. 12, no. 1, pp. 1-11. [https://doi.org/10.2307/2267170]
Putnam, Hilary (1975), “The meaning of ‘meaning’”, Minnesota Studies in the Philosophy of Science, vol. 7, pp. 131-193.
Raatikainen, Panu (2020), “Gödel’s incompleteness Theorems”, in Edward N. Zalta (ed.), The Stanford Encyclopedia of Philosophy, Fall Edition, available on [https://plato.stanford.edu/archives/fall2020/entries/goedel-incompleteness/], accessed:
Rice, H. G. (1953), “Classes of recursively enumerable sets and their decision problems”, Transactions of the American Mathematical Society, vol. 74, pp. 358-366.
Russell, Stuart and Peter Norvig (2010), Artificial Intelligence: A Modern Approach, New Jersey, Pearson Education.
Searle, John R. (1980), “Minds, brains, and programs”, Behavioral and Brain Sciences, vol. 3, no. 3, pp. 417-457.
Simpson, Stephen George (1999), Subsystems of Second Order Arithmetic, Berlin, Springer.
Solovay, Robert Martin (1970), “A model of set-theory in which every set of reals is Lebesgue Measurable”, Annals of Mathematics, vol. 92, pp. 1-56.
Stiegler, Bernard (2017), Automatic Society, Volume 1: The Future of Work, Cambridge, Polity Press.
Turing, Alan (1969 [c. 1948]), “Intelligent machinery”, in Bernard Meltzer and Donald Michie (eds.), Machine Intelligence, vol. 5, Edinburgh, Edinburgh University Press, pp.
Turing, Alan (1950), “Computing machinery and intelligence”, Mind, vol. 59, pp. 433-460.
Turing, A. (1936), “On computable numbers, with an application to the Entscheidungsproblem”, Proceedings of the London Mathematical Society, vol. 42, no. 1, pp. 230-265. Republished (1937), vol. 43, pp. 544-546.
Veisdal, Jørgen (2019), “Uncomputable Numbers. Real numbers we can never know the value of”, in Medium, available on [https://medium.com/cantors-paradise/uncomputable-numbers-ee528830d295], accessed:
Walicki, Michal (2012), Introduction to Mathematical Logic, Singapore, World Scientific.
Wolff, Christian von (1747), Vollständiges Mathematisches Lexicon, Leipzig, Gleditsch.
