Analog computation via neural networks
- 1 September 1994
- journal article
- Published by Elsevier in Theoretical Computer Science
- Vol. 131 (2), 331-360
- https://doi.org/10.1016/0304-3975(94)90178-3
Abstract
No abstract availableKeywords
This publication has 13 references indexed in Scilit:
- On the computational power of sigmoid versus Boolean threshold circuitsPublished by Institute of Electrical and Electronics Engineers (IEEE) ,2002
- On the power of sigmoid neural networksPublished by Association for Computing Machinery (ACM) ,1993
- On the computational power of neural netsPublished by Association for Computing Machinery (ACM) ,1992
- Learning and Extracting Finite State Automata with Second-Order Recurrent Neural NetworksNeural Computation, 1992
- Competitive neural architecture for hardware solution to the assignment problemNeural Networks, 1991
- On a theory of computation and complexity over the real numbers: 𝑁𝑃- completeness, recursive functions and universal machinesBulletin of the American Mathematical Society, 1989
- On connectionist modelsCommunications on Pure and Applied Mathematics, 1988
- The complexity of analog computationMathematics and Computers in Simulation, 1986
- Constant Depth ReducibilitySIAM Journal on Computing, 1984
- Ann Yasuhara. Recursive function theory and logic. Academic Press, New York and London 1971, xv + 338 pp.The Journal of Symbolic Logic, 1975