From newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!cs.utexas.edu!uunet!mcsun!uknet!mucs!fs1.mcc.ac.uk!zlsiida Tue May 12 15:49:53 EDT 1992
Article 5503 of comp.ai.philosophy:
Path: newshub.ccs.yorku.ca!ists!helios.physics.utoronto.ca!news-server.ecf!utgpu!cs.utexas.edu!uunet!mcsun!uknet!mucs!fs1.mcc.ac.uk!zlsiida
>From: zlsiida@fs1.mcc.ac.uk (dave budd)
Newsgroups: comp.ai.philosophy
Subject: Re: penrose
Message-ID: <zlsiida.197@fs1.mcc.ac.uk>
Date: 8 May 92 09:31:19 GMT
References: <2524@ucl-cs.uucp> <1992May1.025230.8835@news.media.mit.edu> <1992May6.220605.26774@unixg.ubc.ca>
Sender: news@cs.man.ac.uk
Organization: Manchester Computing Centre
Lines: 6
Originator: netnews@uts.mcc.ac.uk

Is there an easy-to-follow proof that any neural net can be equivalenced to 
a Turing machine?

+--Great Quotes of our Time---------------------------------------------+
|        Prediction is very difficult, especially of the future.        |
+--------------------------------------------------------Niels Bohr-----+


