TR available from neuroprose; Turing equivalence

[siegelma@yoko.rutgers.edu]

The following report is now available from the neuroprose archive:

           NEURAL NETS ARE UNIVERSAL COMPUTING DEVICES
             H. T. Siegelmann and E.D. Sontag.  (13pp.)

Abstract: It is folk knowledge that neural nets should be capable of
simulating arbitrary computing devices.  Past formalizations of this fact have
been proved under the hypotheses that there are potentially infinitely many
neurons available during a computation and/or that interconnections are
multiplicative.  In this work, we show the existence of a finite network, made
up of sigmoidal neurons, which simulates a universal Turing machine.  It is
composed of less than 100,000 synchronously evolving processors, interconnected
linearly.

-Hava

-----------------------------------------------------------------------------

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

Example:
unix> ftp cheops.cis.ohio-state.edu          # (or ftp 128.146.8.62)
Name (cheops.cis.ohio-state.edu:): anonymous
Password (cheops.cis.ohio-state.edu:anonymous): <ret>
ftp> cd pub/neuroprose
ftp> binary
ftp> get
(remote-file) siegelman.turing.ps.Z
(local-file) siegelman.turing.ps.Z
ftp> quit
unix> uncompress siegelman.turing.ps.Z
unix> lpr -P(your_local_postscript_printer) siegelman.turing.ps

----------------------------------------------------------------------------
If you have any difficulties with the above, please send e-mail to
siegelma at paul.rutgers.edu.   DO NOT "reply" to this message, please.