{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,7,27]],"date-time":"2026-07-27T13:12:11Z","timestamp":1785157931701,"version":"3.55.0"},"reference-count":23,"publisher":"Elsevier BV","issue":"2","license":[{"start":{"date-parts":[[1994,9,1]],"date-time":"1994-09-01T00:00:00Z","timestamp":778377600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.elsevier.com\/tdm\/userlicense\/1.0\/"},{"start":{"date-parts":[[2013,7,17]],"date-time":"2013-07-17T00:00:00Z","timestamp":1374019200000},"content-version":"vor","delay-in-days":6894,"URL":"https:\/\/www.elsevier.com\/open-access\/userlicense\/1.0\/"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Theoretical Computer Science"],"published-print":{"date-parts":[[1994,9]]},"DOI":"10.1016\/0304-3975(94)90178-3","type":"journal-article","created":{"date-parts":[[2002,7,26]],"date-time":"2002-07-26T03:47:37Z","timestamp":1027655257000},"page":"331-360","source":"Crossref","is-referenced-by-count":245,"title":["Analog computation via neural networks"],"prefix":"10.1016","volume":"131","author":[{"given":"Hava T","family":"Siegelmann","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Eduardo D","family":"Sontag","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"78","reference":[{"key":"10.1016\/0304-3975(94)90178-3_BIB1","series-title":"Advanced Research in VLSI: Proceedings of the 1987 Stanford Conference","first-page":"313","article-title":"A neuromorphic VLSI learning system","author":"Alspector","year":"1987"},{"key":"10.1016\/0304-3975(94)90178-3_BIB2","series-title":"An Introduction to Numerical Analysis","author":"Atkinson","year":"1989"},{"key":"10.1016\/0304-3975(94)90178-3_BIB3","series-title":"Structural Complexity","author":"Balcazar","year":"1988"},{"key":"10.1016\/0304-3975(94)90178-3_BIB4","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","article-title":"On a theory of computation and complexity over the real numbers: NP completeness, recursive functions, and universal machines","volume":"21","author":"Blum","year":"1989","journal-title":"Bull. AMS"},{"key":"10.1016\/0304-3975(94)90178-3_BIB5","doi-asserted-by":"crossref","first-page":"423","DOI":"10.1137\/0213028","article-title":"Constant depth reducibility","volume":"13","author":"Chandra","year":"1984","journal-title":"SIAM J. Comput."},{"key":"10.1016\/0304-3975(94)90178-3_BIB6","doi-asserted-by":"crossref","first-page":"431","DOI":"10.1016\/0893-6080(91)90039-8","article-title":"Competitive neural architecture for hardware solution to the assignment problem","volume":"4","author":"Eberhardt","year":"1989","journal-title":"Neural Networks"},{"key":"10.1016\/0304-3975(94)90178-3_BIB7","doi-asserted-by":"crossref","first-page":"260","DOI":"10.1109\/SFCS.1981.35","article-title":"Parity, circuits, and the polynomial-time hierarchy","author":"Furst","year":"1981","journal-title":"Proc. 22nd IEEE Symp. Foundations of Comput. Sci."},{"key":"10.1016\/0304-3975(94)90178-3_BIB8","doi-asserted-by":"crossref","first-page":"393","DOI":"10.1162\/neco.1992.4.3.393","article-title":"Learning and extracting finite state automata with second-order recurrent neural networks","volume":"4","author":"Giles","year":"1992","journal-title":"Neural Comput."},{"key":"10.1016\/0304-3975(94)90178-3_BIB9","doi-asserted-by":"crossref","first-page":"1039","DOI":"10.1002\/cpa.3160410804","article-title":"On connectionist models","volume":"41","author":"Hong","year":"1988","journal-title":"Comm. Pure Appl. Math."},{"key":"10.1016\/0304-3975(94)90178-3_BIB10","first-page":"191","article-title":"Turing machines that take advice","volume":"28","author":"Karp","year":"1982","journal-title":"Enseign. Math."},{"key":"10.1016\/0304-3975(94)90178-3_BIB11","article-title":"On the power of sigmoid neural networks","author":"Kilian","year":"1993","journal-title":"Proc. 6th ACM Workshop on Computational Learning Theory"},{"key":"10.1016\/0304-3975(94)90178-3_BIB12","doi-asserted-by":"crossref","first-page":"767","DOI":"10.1109\/SFCS.1991.185447","article-title":"On the computational power of sigmoid versus Boolean threshold circuits","author":"Maass","year":"1991","journal-title":"Proc. 32nd IEEE Symp. Foundations of Comput. Sci."},{"key":"10.1016\/0304-3975(94)90178-3_BIB13","series-title":"Neural Networks for Knowledge Representation and Inference","article-title":"Continuous symbol systems: the logic of connectionism","author":"MacLennan","year":"1992"},{"key":"10.1016\/0304-3975(94)90178-3_BIB14","doi-asserted-by":"crossref","first-page":"15","DOI":"10.1109\/TEC.1956.5219786","article-title":"Complexity in electronic switching circuits","volume":"5","author":"Muller","year":"1956","journal-title":"IRE Trans. Electronic Comput."},{"key":"10.1016\/0304-3975(94)90178-3_BIB15","series-title":"Threshold Logic and its Applications","author":"Muroga","year":"1971"},{"key":"10.1016\/0304-3975(94)90178-3_BIB16","series-title":"Tech. Report CRPDC-92-2","article-title":"Knowledge, understanding, and computational complexity","author":"Parberry","year":"1992"},{"key":"10.1016\/0304-3975(94)90178-3_BIB17","series-title":"The Computational and Learning Complexity of Neural Networks","author":"Parberry","year":"1994"},{"key":"10.1016\/0304-3975(94)90178-3_BIB18","series-title":"The Emperor's New Mind","author":"Penrose","year":"1989"},{"key":"10.1016\/0304-3975(94)90178-3_BIB19","series-title":"The Complexity of Computing","author":"Savage","year":"1976"},{"key":"10.1016\/0304-3975(94)90178-3_BIB20","doi-asserted-by":"crossref","first-page":"440","DOI":"10.1145\/130385.130432","article-title":"On the computational power of neural nets","author":"Siegelmann","year":"1992","journal-title":"Proc. 5th ACM Workshop on Computational Learning Theory"},{"key":"10.1016\/0304-3975(94)90178-3_BIB21","doi-asserted-by":"crossref","first-page":"91","DOI":"10.1016\/0378-4754(86)90105-9","article-title":"The complexity of analog computation","volume":"28","author":"Vergis","year":"1986","journal-title":"Math Comput. Simulation"},{"key":"10.1016\/0304-3975(94)90178-3_BIB22","unstructured":"D. Wolpert, A computationally universal field computer which is purely linear, Report LA-UR-91-2937, Los Alamos National Laboratory."},{"key":"10.1016\/0304-3975(94)90178-3_BIB23","series-title":"Recursive Function Theory and Logic","author":"Yasuhara","year":"1971"}],"container-title":["Theoretical Computer Science"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901783?httpAccept=text\/xml","content-type":"text\/xml","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/api.elsevier.com\/content\/article\/PII:0304397594901783?httpAccept=text\/plain","content-type":"text\/plain","content-version":"vor","intended-application":"text-mining"}],"deposited":{"date-parts":[[2021,5,14]],"date-time":"2021-05-14T22:37:56Z","timestamp":1621031876000},"score":1,"resource":{"primary":{"URL":"https:\/\/linkinghub.elsevier.com\/retrieve\/pii\/0304397594901783"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1994,9]]},"references-count":23,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1994,9]]}},"alternative-id":["0304397594901783"],"URL":"https:\/\/doi.org\/10.1016\/0304-3975(94)90178-3","relation":{},"ISSN":["0304-3975"],"issn-type":[{"value":"0304-3975","type":"print"}],"subject":[],"published":{"date-parts":[[1994,9]]}}}