The Turing Test

In this paper I argue that whether or not a computer can be built that passes the Turing test is a central question in the philosophy of mind. Then I show that the possibility of building such a computer depends on open questions in the philosophy of computer science: the physical Church-Turing thesis and the extended Church-Turing thesis. I use the link between the issues identified in philosophy of mind and philosophy of computer science to respond to a prominent argument (...) against the possibility of building a machine that passes the Turing test. Finally, I respond to objections against the proposed link between questions in the philosophy of mind and philosophy of computer science. (shrink)

In this paper I argue that Turing’s responses to the mathematical objection are straightforward, despite recent claims to the contrary. I then go on to show that by understanding the importance of learning machines for Turing as related not to the mathematical objection, but to Lady Lovelace’s objection, we can better understand Turing’s response to Lady Lovelace’s objection. Finally, I argue that by understanding Turing’s responses to these objections more clearly, we discover a hitherto unrecognized, substantive thesis in his philosophical (...) thinking about the nature of mind. (shrink)

Department of Computer Engineering, Bilkent University, 06533 Ankara, Turkey E-mail: akman@cs.bilkent.edu.tr; http://www.cs.bilkent.edu.tr/?akman..

Scientific study of dreams requires the most objective methods to reliably analyze dream content. In this context, artificial intelligence should prove useful for an automatic and non subjective scoring technique. Past research has utilized word search and emotional affiliation methods, to model and automatically match human judges’ scoring of dream report’s negative emotional tone. The current study added word associations to improve the model’s accuracy. Word associations were established using words’ frequency of co-occurrence with their defining words as found in (...) a dictionary and an encyclopedia. It was hypothesized that this addition would facilitate the machine learning model and improve its predictability beyond those of previous models. With a sample of 458 dreams, this model demonstrated an improvement in accuracy from 59% to 63% on the negative emotional tone scale, and for the first time reached an accuracy of 77% on the positive scale. (shrink)

on synchronicity, the Fermi Paradox, the Turing Test, and more.

Can machines think? Until what happened today, I thought that no human-made machine could ever think as a human does. I now know that I was wrong.

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.. (shrink)

John Haugeland's Mind design and Mind design II are organized around the idea that the fundamental idea of cognitive science is that, “intelligent beings are semantic engines — in other words, automatic formal systems with interpretations under which they consistently make sense”. The goal of artificial intelligence research, or the problem of “mind design” as Haugeland calls it, is to develop computers that are in fact semantic engines. This paper canvasses the changes in artificial intelligence research reflected in the different (...) selections of essays found in each volume. While Mind design II is a worthy successor to Mind design, there are some notable developments in artificial intelligence which suggest that seemingly intelligent behavior need not be guided by semantic engines at all. (shrink)

Ned Block. Psychologism and behaviorism. Philosophical Review, 90, 5-43.) argued that a behaviorist conception of intelligence is mistaken, and that the nature of an agent's internal processes is relevant for determining whether the agent has intelligence. He did that by describing a machine which lacks intelligence, yet can answer questions put to it as an intelligent person would. The nature of his machine's internal processes, he concluded, is relevant for determining that it lacks intelligence. I argue against Block that it (...) is not the nature of its processes but of its linguistic behavior which is responsible for his machine's lack of intelligence. As I show, not only has Block failed to establish that the nature of internal processes is conceptually relevant for psychology, in fact his machine example actually supports some version of behaviorism. As Wittgenstein has maintained, as far as psychology is concerned, there may be chaos inside. (shrink)

The article deals with some ideas by Turing concerning the background and the birth of the well-known Turing Test, showing the evolution of the main question proposed by Turing on thinking machine. The notions he used, especially that one of imitation, are not so much exactly defined and shaped, but for this very reason they have had a deep impact in artificial intelligence and cognitive science research from an epistemological point of view. Then, it is suggested that the fundamental concept (...) involved in Turing’s imitation game, conceived as a test for detecting the presence of intelligence in an artificial entity, is the concept of interaction, that Turing adopts in a wider, more intuitive and more fruitful sense than the one that is proper to the current research in interactive computing. (shrink)

This issue of the Kybernetes journal is concerned with the philosophical question- Can a Machine Think? Famously, in his 1950 paper `Computing Machinery andIntelligence' [9], the British mathematician Alan Turing suggested replacing this question - which he found \too meaningless to deserve discussion" - with a simple -behavioural - test based on an imagined `Victorianesque' pastime he entitled the`imitation game'. In this special issue of Kybernetes a selection of authors with a special interest in Turing's work (including those who participated (...) in the 2008 AISB Turing Symposium) have been invited to explore and clarify issues arising from Turing's 1950 paper on the Imitation Game; now more widely known as the Turing test. (shrink)

Let psychologism be the doctrine that whether behavior is intelligent behavior depends on the character of the internal information processing that produces it. More specifically, I mean psychologism to involve the doctrine that two systems could have actual and potential behavior _typical_ of familiar intelligent beings, that the two systems could be exactly alike in their actual and potential behavior, and in their behavioral dispositions and capacities and counterfactual behavioral properties (i.e., what behaviors, behavioral dispositions, and behavioral capacities they would (...) have exhibited had their stimuli differed)--the two systems could be alike in all these ways, yet there could be a difference in the information processing that mediates their stimuli and responses that determines that one is not at all intelligent while the other is fully intelligent. (shrink)

For many, the very idea of an artificialintelligence has always been ethicallytroublesome. The putative ability of machinesto mimic human intelligence appears to callinto question the stability of taken forgranted boundaries between subject/object,identity/similarity, free will/determinism,reality/simulation, etc. The artificiallyintelligent object thus appears to threaten thehuman subject with displacement and redundancy.This article takes as its starting point AlanTuring''s famous ''imitation game,'' (the socalled ''Turing Test''), here treated as aparable of the encounter between human originaland machine copy – the born and the made. Thecultural (...) resonances of the recent on-lineperformance of a ''Turing Test'' for computergenerated art are then explored. Arttraditionally taken to stand for all that isconsidered quintessentially human – andtherefore resistant to mechanisation –represents in this sense a kind of ''criticalcase'' in the advance of machine intelligence.The article focuses on the moral status of thebody, human agency, and social knowledge in theongoing (re-)constructions of copy, original,and of the difference between them. (shrink)

On the 27th of October, 1949, the Department of Philosophy at the University of Manchester organized a symposium "Mind and Machine", as Michael Polanyi noted in his Personal Knowledge (1974, p. 261). This event is known, especially among scholars of Alan Turing, but it is scarcely documented. Wolfe Mays (2000) reported about the debate, which he personally had attended, and paraphrased a mimeographed document that is preserved at the Manchester University archive. He forwarded a copy to Andrew Hodges and B. (...) Jack Copeland, who in then published it on their respective websites. The basis of this interpretation here is the copy preserved in the Regenstein Library of the University of Chicago, Special Collections, Polanyi Collection (abbreviated RPC, box 22, folder 19). The same collection holds the mimeographed statement that Polanyi prepared for this symposium: "Can the mind be represented by a machine?" This text has not been studied by Polanyi scholars. (shrink)

Abstract: In the course of seeking an answer to the question "How do you know you are not a zombie?" Floridi (2005) issues an ingenious, philosophically rich challenge to artificial intelligence (AI) in the form of an extremely demanding version of the so-called knowledge game (or "wise-man puzzle," or "muddy-children puzzle")—one that purportedly ensures that those who pass it are self-conscious. In this article, on behalf of (at least the logic-based variety of) AI, I take up the challenge—which is to (...) say, I try to show that this challenge can in fact be met by AI in the foreseeable future. (shrink)

Alan Turing devised his famous test (TT) through a slight modificationof the parlor game in which a judge tries to ascertain the gender of twopeople who are only linguistically accessible. Stevan Harnad hasintroduced the Total TT, in which the judge can look at thecontestants in an attempt to determine which is a robot and which aperson. But what if we confront the judge with an animal, and arobot striving to pass for one, and then challenge him to peg which iswhich? (...) Now we can index TTT to a particular animal and its syntheticcorrelate. We might therefore have TTTrat, TTTcat,TTTdog, and so on. These tests, as we explain herein, are abetter barometer of artificial intelligence (AI) than Turing's originalTT, because AI seems to have ammunition sufficient only to reach thelevel of artificial animal, not artificial person. (shrink)

In this paper we consider the we known method by E. Post of solving the problem of construction of recursively enumerable sets that have a degree intermediate between the degrees of recursive and complete sets with respect to a given reducibility. Post considered reducibilities ≤m, ≤btt, ≤tt and ≤T and solved the problem for al of them except ≤T. Here we extend Post's original method of construction of incomplete sets onto two wide classes of sub-Turing reducibilities what were studying in (...) [1, 2]. (shrink)