Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!uwm.edu!linac!unixhub!slacvm!doctorj
From: DOCTORJ@SLACVM.SLAC.STANFORD.EDU (Jon J Thaler)
Newsgroups: comp.ai.philosophy
Subject: Re: Turing Test: opinions on an idea
Message-ID: <91138.123053DOCTORJ@SLACVM.SLAC.STANFORD.EDU>
Date: 18 May 91 20:30:53 GMT
Distribution: usa
Organization: Stanford Linear Accelerator Center
Lines: 11

In article <1744@anaxagoras.ils.nwu.edu>, will@aristotle.ils.nwu.edu (William
Fitzgerald) says:

>I'm reading a book called _The Vastness of Natural Languages_ by
>Langendoen and Postal, in which they claim/prove that no
>natural language is recursively enumerable.  Accepting
>this as true, this means there is no Turing Machine which can
>be built to recognize the sentences of a natural language.

It's interesting to turn this around and ask whether human intelligence
can recognize (all of) the sentences of a natural language.