Report available --computability with nn's

[sontag@control.rutgers.edu]

(Revised) Tech Report available from neuroprose:

               ON THE COMPUTATIONAL POWER OF NEURAL NETS
          Hava T. Siegelmann, Department of Computer Science
             Eduardo D. Sontag, Department of Mathematics
             Rutgers University, New Brunswick,  NJ 08903


This paper shows the Turing universality of first-order, finite neural nets.
It updates the report placed there last Spring* with new results that include
the simulation in LINEAR TIME of BINARY-tape machines, (as opposed to the unary
alphabets used in the previous version).  The estimate of the number of neurons
needed for universality is now lowered to 1,000 (from 100,000).


*A summary of the older report appeared in: H. Siegelmann and E. Sontag,
"Turing computability with neural nets," Applied Math. Letters 4 (1991): 77-80.

================
To obtain copies of the postscript file, please use Jordan Pollack's service:

Example:
unix> ftp archive.cis.ohio-state.edu                 (or ftp 128.146.8.52)
Name (archive.cis.ohio-state.edu): anonymous
Password (archive.cis.ohio-state.edu:anonymous): <ret>
ftp> cd pub/neuroprose
ftp> binary
ftp> get siegelman.turing.ps.Z
ftp> quit
unix> uncompress  siegelman.turing.ps.Z

Now print "siegelman.turing.ps" as you would any other (postscript) file.