Analog Computation Via Neural Networks

We pursue a particular approach to analog computation, based on dynamical systems of the type used in neural networks research. Our systems have a xed structure, invariant in time, corresponding to an unchanging number of \neurons". If allowed exponential time for computation, they turn out to have unbounded power. However, under polynomial-time constraints there are limits on their capabilities, though being more powerful than Turing Machines. (A similar but more restricted model was shown to be polynomial-time equivalent to classical digital computation in the previous work 20].) Moreover, there is a precise correspondence between nets and standard non-uniform circuits with equivalent resources, and as a consequence one has lower bound constraints on what they can compute. This relationship is perhaps surprising since our analog devices do not change in any manner with input size. We note that these networks are not likely to solve polynomially NP-hard problems, as the equality...

• Type: Conference
• Year: 1993
• Where: ISTCS
• Authors: Hava T. Siegelmann, Eduardo D. Sontag
• Keywords: Applied Computing, Classical Digital Computation, ISTCS 1993, Neural Networks Research, Standard Non-uniform Circuits