Turing's man: a dialogue [Book Review]
David Bourget (Western Ontario)
David Chalmers (ANU, NYU)
Rafael De Clercq
Jack Alan Reynolds
Learn more about PhilPapers
AI and Society 28 (1):21-25 (2013)
soft servants of durable material: they live without pretension in complicated relays and electrical circuits. Speed, docility are their strength. One asks: “What is 2 × 2?”—“Are you a machine?” They answer or refuse to answer, depending on what you demand. There are, however, other machines as well, more abstract automatons, bolder and more inaccessible, which eat their tape in mathematical formulae. They imitate in language. In infinite loops, farther and farther back in their retreat towards more subtle algorithms, more recursive functions. They are logical and describe themselves. As when a man with a hand-mirror pressed against his nose in front of a mirror sees in infinite rows the same image multiplied in a shrinking, darkening corridor of glass. It is a Gödel theorem as good as any. He sees infinity, but what he does not see is his face. (From Göran Printz-Påhlson´s poem “The Turing Machine” published in Säg minns du skeppet Refanut? Samlade dikter 1950–1983 (1984) Bonniers, Stockholm).
|Keywords||The Turing Machine Gödel theorem Breaking the code Enlightenment Automatons Technological society|
|Categories||categorize this paper)|
Setup an account with your affiliations in order to access resources via your University's proxy server
Configure custom proxy (use this if your affiliation does not provide a proxy)
|Through your library|
References found in this work BETA
No references found.
Citations of this work BETA
No citations found.
Similar books and articles
D. King (1996). Is the Human Mind a Turing Machine? Synthese 108 (3):379-89.
Gualtiero Piccinini (2000). Turing's Rules for the Imitation Game. Minds and Machines 10 (4):573-582.
Yaroslav Sergeyev & Alfredo Garro (2010). Observability of Turing Machines: A Refinement of the Theory of Computation. Informatica 21 (3):425–454.
Justin Leiber (2006). Turing's Golden: How Well Turing's Work Stands Today. Philosophical Psychology 19 (1):13-46.
B. Jack Copeland & Oron Shagrir (2011). Do Accelerating Turing Machines Compute the Uncomputable? Minds and Machines 21 (2):221-239.
B. Jack Copeland (2002). Accelerating Turing Machines. Minds and Machines 12 (2):281-300.
Joel David Hamkins (2002). Infinite Time Turing Machines. Minds and Machines 12 (4):567-604.
P. D. Welch (2000). Eventually Infinite Time Turing Machine Degrees: Infinite Time Decidable Reals. Journal of Symbolic Logic 65 (3):1193-1203.
E. Ronald & Moshe Sipper (2001). Intelligence is Not Enough: On the Socialization of Talking Machines. [REVIEW] Minds and Machines 11 (4):567-576.
Joel David Hamkins & Andy Lewis (2000). Infinite Time Turing Machines. Journal of Symbolic Logic 65 (2):567-604.
Edwin J. Beggs, José Félix Costa & John V. Tucker (2010). Physical Oracles: The Turing Machine and the Wheatstone Bridge. Studia Logica 95 (1/2):279 - 300.
Aurea Anguera de Sojo, Juan Ares, Juan A. Lara, David Lizcano, María A. Martínez & Juan Pazos (2013). Turing and the Serendipitous Discovery of the Modern Computer. Foundations of Science 18 (3):545-557.
Jack Copeland (1997). The Broad Conception of Computation. American Behavioral Scientist 40 (6):690-716.
Jack Copeland (1996). On Alan Turing's Anticipation of Connectionism. Synthese 108 (3):361-377.
Added to index2012-02-22
Total downloads7 ( #195,080 of 1,102,036 )
Recent downloads (6 months)1 ( #306,606 of 1,102,036 )
How can I increase my downloads?