Congratulations! You passed the Turing test.
Oded Maler
Subject: Re: Turing Test and Subject Bias
Summary:
Expires:
References: <>
Sender:
Reply-To: od...@wisdom.bitnet (Oded Maler)
Followup-To:
Distribution:
Organization: Weizmann Inst. of Science, Dept. Of Math, Rehovot, Israel
Keywords:
In article <> gil...@cs.glasgow.ac.uk (Gilbert Cockton) writes:
>
>Then how valid is the Turing Test?
>
>Just what sort of Science did young Mr. Turing have in mind when he
>decided that subjective opinion could ever be a measure of system
>performance?
>
>How do AI types *REALLY* test their systems?
>--
The essence of Turing's test is in the notion of INDISTINGUISHABILITY
by an observer. There is a machine in Glasgow that posts
from time to time some sequences of characters that succeed in fooling
me (even when I'm sober) so that I cannot distinguish it from a human
local-patriotic social-science-type :-{}. Such a machine passes the Turing
test. Maybe a stronger observer than myself (exponential, infinite) would
have caught this imposter.
Of course this is not "science" unless I augment it with statistical
"objective" gadgets.
BTW, Turing's test ideas had a lot of influence (so my crypto friends tell
me) on various notions in Cryptography and Complexity such as interactive
proofs and zero-knowledge protocols. But there you have to distinguish
between someone who knows some fact and someone who doesn't, or between
random and non-random, and not between intelligent and non-intelligent.
Oded Maler
Department of Applied Mathematics
Weizmann Institute of Science
Rehovot 76100, Israel
(od...@wisdom.bitnet)
Jim Winer @ AT&T, Middletown, NJ
| |Then how valid is the Turing Test?
| |
| |Just what sort of Science did young Mr. Turing have in mind when he
| |decided that subjective opinion could ever be a measure of system
| |performance?
| |
| |How do AI types *REALLY* test their systems?
Oded Maler replies:
| The essence of Turing's test is in the notion of INDISTINGUISHABILITY
| by an observer. There is a machine in Glasgow that posts
| from time to time some sequences of characters that succeed in fooling
| me (even when I'm sober) so that I cannot distinguish it from a human
| local-patriotic social-science-type :-{}. Such a machine passes the Turing
| test. Maybe a stronger observer than myself (exponential, infinite) would
| have caught this imposter.
It is clear, based on the postings to this newsgroup, that to pass the
Turing test and be indistinguishable from a human, a machine must be
at the minimum, sarcastic and inane on occasion. A machine which
does not exhibit emotional response or a sense of humor might be
considered anti-intelligent, but certainly not human. Let us not
become so serious about the bullshit we wade through that we cannot
laugh at ourselves. Flaming is a strictly human activity.
Jim Winer ..!lzfme!jwi
I believe in absolute freedom of the press.
Pax Probiscus! Sturgeon's Law (Revised): 98.89%
of everything is drek (1.11% is peanut butter).
Rarely able to send an email reply sucessfully.
The opinions expressed here are not necessarily
Those persons who advocate censorship offend my religion.
Chris Malcolm cam@uk.ac.ed.edai 031 667 1011 x2550
>It is clear, based on the postings to this newsgroup, that to pass the
>Turing test and be indistinguishable from a human, a machine must be
>at the minimum, sarcastic and inane on occasion. A machine which
>does not exhibit emotional response or a sense of humor might be
>considered anti-intelligent, but certainly not human. Let us not
>become so serious about the bullshit we wade through that we cannot
>laugh at ourselves. Flaming is a strictly human activity.
Don't underestimate Turing! He made it clear that the machine would have
to mimic human imperfections, such as making arithmetic mistakes,
although, as a proper gentleman, he refrained from clarifying the
possible interpretation of his paper that he considered mistakes in
arithmetic to be specially characteristic of women :-)
On a more serious note, Harnad has suggested that the linguistic
competence required by the Turing Test will in practice be unachievable
by an implementation short of a robot, i.e., a creature in a world, as
opposed to a brain (or computer) in a bottle attached to a terminal. In
that case, Koestler's analysis of humour suggests that you might not be
able to build an intelligent robot without _necessarily_ equipping it with
a sense of humour. In other words, if you want to build a machine to
pass the Turing Test, it may be quite unnecessary to _simulate_ humour,
etc., these things may turn out to be an essential part of the
architecture, much in the same way as any decently powerful vision
system will be prone to optical illusions.
It's a question of how many ways there are of being intelligent (those
who think intelligence is a silly concept please supply an alternative
word here); maybe there's only one (I'm serious - what is the
alternative to "intelligent" here?). How many ways are there of doing
arithmetic? Forgetting such trivial transformations as base systems, it
is a presumption of the SETI program that there is only one way - the
universal language of number and logic which all industrial-quality
extraterrestials (and presumably robots) _must_ understand.
--
Chris Malcolm c...@uk.ac.ed.edai 031 667 1011 x2550
Department of Artificial Intelligence, Edinburgh University
5 Forrest Hill, Edinburgh, EH1 2QL, UK
Don Park
>by an observer. There is a machine in Glasgow that posts
'''''''''''''''''''''''''''''
>from time to time some sequences of characters that succeed in fooling
>me (even when I'm sober) so that I cannot distinguish it from a human
>local-patriotic social-science-type :-{}. Such a machine passes the Turing
Is there a public access system somewhere where one could call
by modem to see an example of advanced natural language parsing?
Can someone suggest a good place to start for studing about NLP?
Thanks,
Don Park
--
+------------- Bark Technologies - Don Park - Bryan Bybee ------------------+
: BBS (503)-257-3666 - VOICE (503)-246-0025 - (503)-256-2195 - Bark Tech. /\ :
: Hardware - Software - IBM - TANDY COLOR COMPUTER - Support - Tech. Line \/ :
+----------------- ...!tektronix!teksce!bucket!donp --------------------------+
Gilbert Cockton
>>The essence of Turing's test is in the notion of INDISTINGUISHABILITY
>>by an observer. There is a machine in Glasgow that posts
>
>by modem to see an example of advanced natural language parsing?
The Cockton program in Glasgow has public access, but not by modem.
Fly to Prestwick (North-West :-)), bus to Buchanan Street, Underground
to Hillhead and walk across the car park to 17 Lilybank Gardens.
Alternatively, you can talk direct, without modem, on +44 41 339 8855
extension 5569 :-)
--
Gilbert Cockton, Department of Computing Science, The University, Glasgow
gil...@uk.ac.glasgow.cs <europe>!ukc!glasgow!gilbert
Thom Whalen
>>
>>Is there a public access system somewhere where one could call
>>by modem to see an example of advanced natural language parsing?
>
information system about AIDS. We try to keep it available, but the
modem routines are rather flaky, so I cannot guarentee that it will
always work properly.
It answers with a Hayes 2400 baud modem, so it can be accessed at
2400, 1200 or 300 baud, no parity.
--------------------------------------------------------------------
"The user interface IS the program."
Thomas Whalen (613) 990-4683 th...@dgbt.crc.dnd.ca
Communications Research Center, Government of Canada, Ottawa, Canada