Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!usc!wuarchive!zaphod.mps.ohio-state.edu!casbah.acns.nwu.edu!ils.nwu.edu!aristotle.ils.nwu.edu!will
From: will@aristotle.ils.nwu.edu (William Fitzgerald)
Newsgroups: comp.ai.philosophy
Subject: Re: Turing Test: opinions on an idea
Message-ID: <1744@anaxagoras.ils.nwu.edu>
Date: 16 May 91 18:09:37 GMT
References: <1991May13.133711.102@athena.mit.edu>
Sender: news@ils.nwu.edu
Distribution: usa
Organization: The Institute for the Learning Sciences
Lines: 5

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.