What can Philosophy say, in principle, about Computers?


Tito Marques Palmeiro http://orcid.org/0000-0001-8467-2880


Computers are the unexpected outcome of mathematical investigations from the first half of the 20th century. From mathematics to physics, and even to biology, there are many scientific disciplines in charge of their development nowadays; however, the same cannot be said about philosophy. My purpose is to understand whether philosophy would have something relevant to say about computers, even though it does not play any relevant role in this new endeavor. I consider that in order to answer this question, philosophical inquiry must discuss, in the first place, the work of Alan Turing. He created the concept of computer in a 1936-1937 paper, “On Computable Numbers, with an Application to the Entscheidungsproblem”, and he also reflected upon the extreme implications of this concept on later texts, as in a 1947 lecture on the Automatic Computing Engine (ACE), where he expressed some interesting possibilities for understanding how computers and philosophy relate to each other. I intend to show therewith that his work offers some important insights for answering the decisive philosophical question on this subject: What can philosophy say, in principle, about computers?


Os computadores são o resultado inesperado de investigações matemáticas da primeira metade do século XX. Da matemática à física, e mesmo à biologia, há muitas disciplinas científicas encarregadas de seu desenvolvimento hoje em dia; no entanto, o mesmo não pode ser dito sobre a filosofia. Meu objetivo é entender se a filosofia teria algo relevante a dizer sobre os computadores, ainda que não tenha papel relevante nessa nova empreitada. Considero que, para responder a essa pergunta, a investigação filosófica deve discutir, em primeiro lugar, a obra de Alan Turing. Ele criou o conceito de computador em um artigo de 1936-1937, “On Computable Numbers, with an Application to the Entscheidungsproblem”, e também refletiu sobre as implicações extremas desse conceito em textos posteriores, como em uma palestra de 1947 sobre o Automatic Computing Engine (ACE), onde expressou algumas possibilidades interessantes para entender como os computadores e a filosofia se relacionam. Pretendo mostrar com isso que sua obra oferece alguns insights importantes para responder à questão filosófica decisiva sobre esse assunto: O que a filosofia pode dizer, em princípio, sobre os computadores?



Como Citar
PALMEIRO, Tito Marques. What can Philosophy say, in principle, about Computers?. O que nos faz pensar, [S.l.], v. 29, n. 49, p. 5-16, jan. 2022. ISSN 0104-6675. Disponível em: <http://oquenosfazpensar.fil.puc-rio.br/index.php/oqnfp/article/view/792>. Acesso em: 03 oct. 2022. doi: https://doi.org/10.32334/oqnfp.2021n49a792.


CHAITIN, Gregory. Thinking about Gödel and Turing. Essays on Complexity, 1970-2007. Singapore: World Scientific Publishing Co., 2007.
COPELAND, Jack. The Essential Turing: Seminal Writings in Computing, Logic, Philosophy, Artificial Intelligence, and Artificial Life plus The Secrets of Enigma, Oxford: Clarendon Press (Oxford University Press), 2004.
CHURCH, Alonzo. “Review: A. M. Turing, On Computable Numbers, with an Application to the Entscheidungsproblem”. Journal of Symbolic Logic (2): 42–43, 1937.
DAVIS, P. J. Fidelity in mathematical discourse: Is one and one really two? The American Mathematical Monthly 79, 3 (1972), 252-263.
DE MILLO, Richard; LIPTON, Richard; PERLIS, Alan. Social Processes and Proofs of Theorems and Programs. Communications of the ACM, May 1979, volume 22, number 5.
FETZER, James. Program verification: The very idea. Communications of the ACM. September 1988, Volume 3, Number 9.
GÖDEL, Kurt. Remarks before the Princeton bicentennial conference on problems in mathematics (1946), Collected Works, volume II, publications 1938-1974. New York: Oxford, 1990.
MACKENZIE, Donald. Mechanizing Proof: Computing, Risk, and Trust. Cambridge: MIT Press, 2004.
PETZOLD, Charles. The Annotated Turing: A Guided Tour through Alan Turing's Historic Paper on Computability and the Turing Machine. Indianapolis: Wiley Publishing, 2008.
POST, Emil. “Recursive Unsolvability of a Problem of Thue”. The Journal of Symbolic Logic, Vol. 12, No. 1. (Mar., 1947), pp. 1-11.
TURING, Alan. “Intelligent Machinery” (1948) in The Essential Turing
TURING, Alan. “Alan Turing’s Manual for the Ferranti Mk. I” (1951). http://curation.cs.manchester.ac.uk/computer50/www.computer50.org/kgill/mark1/RobertTau/turing.pdf
TURING, Alan. Intelligent Machinery, a Heretical Theory” (1951) in The Essential Turing
TURING, Alan. “Lecture to the London Mathematical Society, February, 20, 1947, on ACE”. AMT/B/1: http://www.turingarchive.org/browse.php/B/1.
TURING, Alan. Proposed Electronic Calculator (ACE). (1945) AMT/C/32: http://www.turingarchive.org/browse.php/C/32.
RUSSELL, Bertrand. Introduction to Mathematical Philosophy, second edition. George Allen & Unwin, 1920; Dover, 1993.