Selected citations from 1994 to mid 2000 for: ``Analog computation, neural networks, and circuits,'' Theor. Comp. Sci. 131(1994): 331-360. (about 40) Moore C, Crutchfield JP Quantum automata and quantum grammars THEOR COMPUT SCI 237: (1-2) 275-306 APR 28 2000 Hammer B On the approximation capability of recurrent neural networks NEUROCOMPUTING 31: (1-4) 107-123 MAR 2000 Siegelmann HT Stochastic analog networks and computational complexity J COMPLEXITY 15: (4) 451-475 DEC 1999 Margenstern M Frontier between decidability and undecidability: a survey THEOR COMPUT SCI 231: (2) 217-251 JAN 28 2000 Siegelmann HT, Margenstern M Nine switch-affine neurons suffice for Turing universality NEURAL NETWORKS 12: (4-5) 593-600 JUN 1999 Copeland BJ, Sylvan R Beyond the universal Turing machine AUSTRALAS J PHILOS 77: (1) 46-67 MAR 1999 Gavalda R, Siegelmann HT Discontinuities in recurrent neural networks NEURAL COMPUT 11: (3) 715-745 APR 1 1999 Siegelmann HT Neural dynamics with stochasticity LECT NOTES ARTIF INT 1387: 346-369 1998 van Gelder T The dynamical hypothesis in cognitive science BEHAV BRAIN SCI 21: (5) 615-+ OCT 1998 Adamatzky A Universal dynamical computation in multidimensional excitable lattices INT J THEOR PHYS 37: (12) 3069-3108 DEC 1998 Koiran P, Moore C Closed-form analytic maps in one and two dimensions can simulate universal Turing machines THEOR COMPUT SCI 210: (1) 217-223 JAN 6 1999 Balcazar JL, Hermo M The structure of logarithmic advice complexity classes THEOR COMPUT SCI 207: (1) 217-244 OCT 28 1998 Tsuda I, Yamaguchi A Singular-continuous nowhere-differentiable attractors in neural systems NEURAL NETWORKS 11: (5) 927-937 JUL 1998 Siegelmann HT, Fishman S Analog computation with dynamical systems PHYSICA D 120: (1-2) 214-235 SEP 1 1998 Koiran P, Sontag ED Vapnik-Chervonenkis dimension of recurrent neural networks DISCRETE APPL MATH 86: (1) 63-79 AUG 18 1998 Moore C Dynamical recognizers: real-time language recognition by analog computers THEOR COMPUT SCI 201: (1-2) 99-136 JUL 6 1998 Siegelmann HT, Nissan E, Galperin A A novel neural/symbolic hybrid approach to heuristically optimized fuel allocation and automated revision of heuristics in nuclear engineering ADV ENG SOFTW 28: (9) 581-592 DEC 1997 Balcazar JL, Gavalda R, Siegelmann HT Computational power of neural networks: A characterization in terms of Kolmogorov complexity IEEE T INFORM THEORY 43: (4) 1175-1183 JUL 1997 Cucker F Machines over the reals and non-uniformity MATH LOGIC QUART 43: (2) 143-157 1997 Copeland BJ The broad conception of computation AM BEHAV SCI 40: (6) 690-716 MAY 1997 Orponen P Computing with truly asynchronous threshold logic networks THEOR COMPUT SCI 174: (1-2) 123-136 MAR 15 1997 Siegelmann HT, Horne BG, Giles CL Computational capabilities of recurrent NARX neural networks IEEE T SYST MAN CY B 27: (2) 208-215 APR 1997 Koiran P A weak version of the Blum, Shub, and Smale model J COMPUT SYST SCI 54: (1) 177-189 FEB 1997 Turan G, Vatan F On the computation of Boolean functions by analog circuits of bounded fan-in J COMPUT SYST SCI 54: (1) 199-212 FEB 1997 Cucker F, Grigoriev D On the power of real turing machines over binary inputs SIAM J COMPUT 26: (1) 243-254 FEB 1997 Bournez O, Cosnard M On the computational power of dynamical systems and hybrid systems THEOR COMPUT SCI 168: (2) 417-459 NOV 20 1996 Siegelmann HT The simple dynamics of super Turing theories THEOR COMPUT SCI 168: (2) 461-472 NOV 20 1996 Koiran P A family of universal recurrent networks THEOR COMPUT SCI 168: (2) 473-480 NOV 20 1996 Siegelmann HT Recurrent neural networks and finite automata COMPUT INTELL 12: (4) 567-574 NOV 1996 Tsuda I A new type of self-organization associated with chaotic dynamics in neural networks INT J NEURAL SYST 7: (4) 451-459 SEP 1996 Siegelmann HT Recurrent neural networks LECT NOTES COMPUT SC 1000: 29-45 1995 Cucker F, Matamala M On digital nondeterminism MATH SYST THEORY 29: (6) 635-647 NOV-DEC 1996 Kilian J, Siegelmann HT The dynamic universality of sigmoidal neural networks INFORM COMPUT 128: (1) 48-56 JUL 10 1996 Horne BG, Hush DR Bounds on the complexity of recurrent neural network implementations of finite state machines NEURAL NETWORKS 9: (2) 243-252 MAR 1996 Orponen P The computational power of discrete Hopfield nets with hidden units NEURAL COMPUT 8: (2) 403-415 FEB 15 1996 Siegelmann HT Analog computational power - Reply SCIENCE 271: (5247) 373-373 JAN 19 1996 TINO P, SAJDA J LEARNING AND EXTRACTING INITIAL MEALY AUTOMATA WITH A MODULAR NEURAL-NETWORK MODEL NEURAL COMPUT 7: (4) 822-844 JUL 1995 SIEGELMANN HT COMPUTATION BEYOND THE TURING LIMIT SCIENCE 268: (5210) 545-548 APR 28 1995 SIEGELMANN HT, SONTAG ED ON THE COMPUTATIONAL POWER OF NEURAL NETS J COMPUT SYST SCI 50: (1) 132-150 FEB 1995 KOIRAN P COMPUTING OVER THE REALS WITH ADDITION AND ORDER THEOR COMPUT SCI 133: (1) 35-47 OCT 10 1994