Account Options

  1. Sign in
The old Google Groups will be going away soon, but your browser is incompatible with the new version.
Google Groups Home
« Groups Home
Message from discussion LISP - 2 exponent 0 = 1

Path: archiver1.google.com!news1.google.com!newsfeed.stanford.edu!news-spur1.maxwell.syr.edu!news.maxwell.syr.edu!newsfeed.nyu.edu!typhoon.nyu.edu!53ab2750!not-for-mail
Sender: marc...@octagon.mrl.nyu.edu
Newsgroups: comp.lang.lisp
Subject: Re: LISP - 2 exponent 0 = 1
References: <am64ua$j6h$1@usenet.otenet.gr> <7fe97cc4.0209190043.eed48db@posting.google.com> <7b8f89d6.0209190934.5e94f860@posting.google.com> <amegak$as9$2@usenet.otenet.gr> <y6cptv8ftla.fsf@octagon.mrl.nyu.edu> <amfo22$j8o$1@usenet.otenet.gr> <y6c65x0fpo8.fsf@octagon.mrl.nyu.edu> <amhabp$oto$1@usenet.otenet.gr>
From: Marco Antoniotti <marc...@cs.nyu.edu>
Message-ID: <y6ck7lf3wz0.fsf@octagon.mrl.nyu.edu>
Lines: 141
User-Agent: Gnus/5.09 (Gnus v5.9.0) Emacs/21.2
MIME-Version: 1.0
Content-Type: text/plain; charset=us-ascii
Date: 21 Sep 2002 16:32:19 -0400
NNTP-Posting-Host: 128.122.47.83
X-Trace: typhoon.nyu.edu 1032640243 128.122.47.83 (Sat, 21 Sep 2002 16:30:43 EDT)
NNTP-Posting-Date: Sat, 21 Sep 2002 16:30:43 EDT
Organization: New York University


Apologies for the full quote.

ilias <at_n...@pontos.net> writes:

> Marco Antoniotti wrote:
> > ilias <at_n...@pontos.net> writes:
> >
> >>Marco Antoniotti wrote:
> >>
> >>>ilias <at_n...@pontos.net> writes:
> >>>
> >>>>larry wrote:
> >>>>
> >>>>>ilias,
> >>>>>Would you be willing to take the Turing test to determine if
> >>>>>you're a human?
> >>>>
> >>>>Explain me with easy terminology (i'm undereducated) what a Turing
> >>>>test is.
> >>>
> >>>Something you have been trying very hard to pass. :)
> >>>The Turing Test is a way of dettermine if a "machine" has achieved
> >>>"intelligence".  Or, in a more limited way, it is a test to see
> >>>whether the response of a machine and the response of a human are
> >>>indistiguishable by a group of witnesses.
> 
> judge: group of witnesses.

Note that I am just citing from memory.  I suppose that on the net
there is more information available.

> 
> >>>A simple Google search will fill in the details.
> >>>Since it has been suggested up here that you are actually an A.I.,
> >>>the
> >>>fact that you show ignorance of the Turing Test could be seen as a
> >>>ruse by your programmer(s) to fool the denizens of C.L.L. into
> >>>thinking that you are actually human.
> >>
> >>sounds like 'paranoia'.
> > Do you mean that you are paranoic or that I am paranoic.
> 
> "could be seen" => paranoia.

I am sorry, I do not understand this comment.

> 
> > Are we like Eliza and Parry?
> 
> irrlevant.

True.  But a little bit of humor has never hurt anybody. (Has it?)

> 
> >>>>Then i can answer you.
> >>>
> >>>That *is* a good answer.  Either you do have a sense of irony
> >>>(something people doubted, looking at the responses you get) or your
> >>>programmer(s) did program some of it into you. :)
> >>
> >>OK, i've understood.
> > What?
> 
>  >>>>Explain me with easy terminology (i'm undereducated) what a Turing
>  >>>>test is.
> 
> Turing Test.
> 
> >>But i remember the name Turing in context of programing-languages.
> > Do a search on Google for Alan Turing (1912-1954).
> 
> He dies young.
> 
> >>Is Lisp Turing-Complete?
> > Yes.
> >
> >>What is 'Turing-Complete'?
> > Essentially, a programming language L is Turing Complete if there
> > exists an algorithm transforming a program in L into the code for a
> > Turing machine.
> 
> what is a 'Turing machine'?

A good reference id "J. E. Hopcroft and J. D. Ullman, Introduction to
Automata Theory, Languages and Computation, Addison-Wesley, 1979".

It is just a book, but some books are good. 

> 
> >>I cannot extract a meaning, based on the information 'Turing-Test' you
> >>just gave me.
> > I can only point the direction.  Books and Google are ther for this
> 
> you don't pass my 'Turing Test'.

Then you maintain that I am a machine.  How do you purport to go ahead
and prove to others up here that I am a machine?

> > reason.  Everybody has time constraints which are best spent doing
> > real work instead of quibbling on minutiae of the Common Lisp
> > specification.
> 
> remark irrelevant.

It depends.  It may be irrelevant for you.  But suppose it wasn't?
What would you do differently if you found the remark relevant?

> > My version of the Turing test would ask to discriminate between
> > relevant and irrelevant issue in the line of questions and answers.
> > And note that I would be the judge. :)
> 
> thus the quality of your test depends on the quality of your judge.

Well, I trust my judgement, hence my test is going to be pretty good.

> sounds not good.

That is your problem.  Remember: I am the judge, not you.

> 
> > Cheers
> 
> Turing Test: comparing A.I. against H.I. (Human Intelligence), judged
> by human intelligence.
> 
> I think i don't like the 'Turing-Test'.
>

Why don't you like it?  In some ways it is a playful game put forth by
one of the great minds of our century to address a deep question.

Cheers

-- 
Marco Antoniotti ========================================================
NYU Courant Bioinformatics Group        tel. +1 - 212 - 998 3488
715 Broadway 10th Floor                 fax  +1 - 212 - 995 4122
New York, NY 10003, USA                 http://bioinformatics.cat.nyu.edu
                    "Hello New York! We'll do what we can!"
                           Bill Murray in `Ghostbusters'.