Turing's man: a dialogue
AI and Society 28 (1):21-25 (2013)
| Abstract | 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 | No keywords specified (fix it) | |||||||||
| Categories | ||||||||||
| Options |
|
|||||||||
| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,875 |
| External links |
|
| Through your library | Configure |
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. 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 (forthcoming). Physical Oracles: The Turing Machine and the Wheatstone Bridge. Studia Logica.
Aurea Anguera de Sojo, Juan Ares, Juan A. Lara, David Lizcano, María A. Martínez & Juan Pazos (forthcoming). Turing and the Serendipitous Discovery of the Modern Computer. Foundations of Science:1-13.
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.
Monthly downloads |
Added to index2012-02-22Total downloads7 ( #134,900 of 556,837 )Recent downloads (6 months)1 ( #64,847 of 556,837 )How can I increase my downloads? |

