Alan Turing: Mathematical Mechanist
| Abstract | I live just off of Bell Road outside of Newburgh, Indiana, a small town of 3,000 people. A mile down the street Bell Road intersects with Telephone Road not as a modern reminder of a technology belonging to bygone days, but as testimony that this technology, now more than a century and a quarter old, is still with us. In an age that prides itself on its digital devices and in which the computer now equals the telephone as a medium of communication, it is easy to forget the debt we owe to an era that industrialized the flow of information, that the light bulb, to pick a singular example, which is useful for upgrading visual information we might otherwise overlook, nonetheless remains the most prevalent of all modern day information technologies. Edison’s light bulb, of course, belongs to a different order of informational devices than the computer, but not so the telephone, not entirely anyway. Alan Turing, best known for his work on the Theory of Computation (1937), the Turing Machine (also 1937) and the Turing Test (1950), is often credited with being the father of computer science and the father of artificial intelligence. Less well-known to the casual reader but equally important is his work in computer engineering. The following lecture on the Automatic Computing Engine, or ACE, shows Turing in this different light, as a mechanist concerned with getting the greatest computational power from minimal hardware resources. Yet Turing’s work on mechanisms is often eclipsed by his thoughts on computability and his other theoretical interests. This is unfortunate for several reasons, one being that it obscures our picture of the historical trajectory of information technology, a second that it emphasizes a false dichotomy between “hardware” and “software” to which Turing himself did not ascribe but which has, nonetheless, confused researchers who study the nature of mind and intelligence for generations.. | |||||||||
| Keywords | No keywords specified (fix it) | |||||||||
| Categories | No categories specified (fix it) | |||||||||
| Options |
|
|||||||||
Download options| PhilPapers Archive |
Upload a copy of this paper Check publisher's policy on self-archival Papers currently archived: 5,705 |
| External links |
  Try with proxy. |
| Through your library | Only published papers are available at libraries |
Similar books and articlesJustin Leiber (2006). Turing's Golden: How Well Turing's Work Stands Today. Philosophical Psychology 19 (1):13-46.
Gualtiero Piccinini (2003). Alan Turing and the Mathematical Objection. Minds and Machines 13 (1):23-48.
Jack Copeland (1996). On Alan Turing's Anticipation of Connectionism. Synthese 108 (3):361-377.
Saul Traiger (2000). Making the Right Identification in the Turing Test. Minds and Machines 10 (4):561-572.
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.
Benny Shanon (1989). A Simple Comment Regarding the Turing Test. Journal for the Theory of Social Behaviour 19 (June):249-56.
Stuart Shanker (1995). Turing and the Origins of AI. Philosophia Mathematica 3 (1):52-85.
B. Jack Copeland & Diane Proudfoot (2000). What Turing Did After He Invented the Universal Turing Machine. Journal of Logic, Language and Information 9 (4):491-509.
Stuart M. Shieber (2007). The Turing Test as Interactive Proof. Noûs 41 (4):686–713.
Analytics
Monthly downloads |
Added to index2011-06-20Total downloads15 ( #78,702 of 549,128 )Recent downloads (6 months)1 ( #63,361 of 549,128 )How can I increase my downloads? |
My notes
Discussion
