Path: utzoo!utgpu!news-server.csri.toronto.edu!rpi!think.com!zaphod.mps.ohio-state.edu!wuarchive!udel!haven.umd.edu!mimsy!mojo!eng.umd.edu!clin
From: clin@eng.umd.edu (Charles Chien-Hong Lin)
Newsgroups: comp.ai.philosophy
Subject: Re: Turing Test: opinions on an idea
Message-ID: <1991May28.005200.15851@eng.umd.edu>
Date: 28 May 91 00:52:00 GMT
References: <1991May13.133711.102@athena.mit.edu> <1744@anaxagoras.ils.nwu.edu>
Sender: news@eng.umd.edu (C-News)
Reply-To: clin@eng.umd.edu (Charles Chien-Hong Lin)
Distribution: usa
Organization: College of Engineering, Maryversity of Uniland, College Park
Lines: 17

In article <1744@anaxagoras.ils.nwu.edu>, will@aristotle.ils.nwu.edu (William Fitzgerald) writes:
> 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.

  Assuming Church's thesis is true, that is.

--
   ____         _
  /    |     __|_|       clin@eng.umd.edu
 |             |         
 |  harles    |  in      "University of Maryland Institute of Technology"
 |          _|
  \_____/  |_|\___/