ONE HIDDEN LAYER IS ENOUGH -- re "what is a net?" discussion

[sontag@fermat.rutgers.edu]

This is in response to Alexis Wieland's request:

	"G. Cybenko are you out there, and are you willing to say where your
	paper "Approximation by Superpositions of a Sigmoidal Function" can be
	found by the hungary (sic) masses?"

(Presumably non-Hungarian masses are interested too, so:)

The paper by George Cybenko that proves this theorem (a neural network with
one hidden layer of nodes with a fixed sigmoid transfer function can uniformly
approximate any continuous function) is scheduled to appear in

     MATHEMATICS OF CONTROL, SIGNALS, AND SYSTEMS, Vol.2 (1989), Number 4.

Your library should have this journal, which specializes in the formal
mathematical analysis of problems related to signal processing and systems.
(The journal has published many other papers that should be relevant to
theoretical connectionist research, such as papers on iterated projection
methods, estimation, interpolation techniques, identification, and adaptive
control.)  If your library doesn't yet subscribe, you might as well provide
them with the following info:

MATHEMATICS OF CONTROL, SIGNALS, AND SYSTEMS
Springer-Verlag New York, Inc
ISSN 0932-4194, Title # 498

In North America, order from:

Springer-Verlag New York, Inc
Journal Fulfillment Services
44 Hartz Way, Secaucus, NJ 07094

(Volume 2, 1989 ... $179.00 incl. p&h)

Outside NA, order from:

Springer-Verlag
Heidelberger Platz 3
D-1000 Berlin 33, FRG

(Volume 2, 1989 ... DM 348.- incl. p&h)

-bradley dickinson and eduardo d. sontag, co-Managing eds.