{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,26]],"date-time":"2025-03-26T03:16:17Z","timestamp":1742958977068,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":54,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540643418"},{"type":"electronic","value":"9783540697527"}],"license":[{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,1,1]],"date-time":"1998-01-01T00:00:00Z","timestamp":883612800000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[1998]]},"DOI":"10.1007\/bfb0054004","type":"book-chapter","created":{"date-parts":[[2006,6,7]],"date-time":"2006-06-07T05:55:04Z","timestamp":1149659704000},"page":"346-369","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":1,"title":["Neural dynamics with stochasticity"],"prefix":"10.1007","author":[{"given":"Hava T.","family":"Siegelmann","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2006,5,25]]},"reference":[{"key":"12_CR1","first-page":"75","volume":"19","author":"L. Adleman","year":"1978","unstructured":"L. Adleman. Two theorems on random polynomial time. In IEEE Sympos. on Foundations of Computer Science, volume 19, pages 75\u201383, New-York, 1978.","journal-title":"IEEE Sympos. on Foundations of Computer Science"},{"key":"12_CR2","doi-asserted-by":"crossref","unstructured":"J. L. Balc\u00e1zar, J. D\u00edaz, and J. Gabarr\u00f3. Structural Complexity, volume I and II. Springer-Verlag EATCS Monographs, Berlin, 1988\u20131990. Second Edition for Volume I in 1995.","DOI":"10.1007\/978-3-642-75357-2"},{"key":"12_CR3","first-page":"315","volume":"1","author":"J. L. Balc\u00e1zar","year":"1992","unstructured":"J. L. Balc\u00e1zar, M. Hermo, and E. Mayordomo. Characterizations of logarithmic advice complexity classes. Information Processing 92, IFIP Transactions A-12, 1:315\u2013321, 1992.","journal-title":"Information Processing 92, IFIP Transactions A-12"},{"key":"12_CR4","unstructured":"A.R. Barron. Neural net approximation. In Proc. Seventh Yale Workshop on Adaptive and Learning Systems, pages 69\u201372, Yale University, 1992."},{"key":"12_CR5","doi-asserted-by":"crossref","first-page":"151","DOI":"10.1162\/neco.1989.1.1.151","volume":"1","author":"E.B. Baum","year":"1989","unstructured":"E.B. Baum and D. Haussler. What size net gives valid generalization? Neural Computation, 1:151\u2013160, 1989.","journal-title":"Neural Computation"},{"key":"12_CR6","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1090\/S0273-0979-1989-15750-9","volume":"21","author":"L. Blum","year":"1989","unstructured":"L. Blum, M. Shub, and S. Smale. On a theory of computation and complexity over the real numbers: Np completeness, recursive functions, and universal machines. Bull. A.M.S., 21:1\u201346, 1989.","journal-title":"Bull. A.M.S."},{"key":"12_CR7","first-page":"145","volume":"16","author":"G.J. Chaitin","year":"1969","unstructured":"G.J. Chaitin. On the length of programs for computing finite binary sequences: statistical considerations. J. A.C.M., 16:145\u2013159, 1969.","journal-title":"J. A.C.M."},{"key":"12_CR8","doi-asserted-by":"crossref","first-page":"303","DOI":"10.1007\/BF02551274","volume":"2","author":"G. Cybenko","year":"1989","unstructured":"G. Cybenko. Approximation by superpositions of a sigmoidal function. Math. Control, Signals, and Systems, 2:303\u2013314, 1989.","journal-title":"Math. Control, Signals, and Systems"},{"key":"12_CR9","first-page":"59","volume":"13","author":"R.L. Dobrushin","year":"1977","unstructured":"R.L. Dobrushin and S.I. Ortyukov. Lower bound for the redundancy of self-correcting arrangement of unreliable functional elements. Problems info, Transmission, 13:59\u201365, 1977.","journal-title":"Problems info, Transmission"},{"key":"12_CR10","first-page":"346","volume":"13","author":"R.L. Dobrushin","year":"1977","unstructured":"R.L. Dobrushin and S.I. Ortyukov. Upper bound for the redundancy of self-correcting arrangement of unreliable functional elements. Problems info, Transmission, 13:346\u2013353, 1977.","journal-title":"Problems info, Transmission"},{"key":"12_CR11","volume-title":"PhD thesis","author":"Y. Finkelstein","year":"1994","unstructured":"Y. Finkelstein. Cholinergic Mechanisms of Control and Adaptation in the Rat Septo-Hippocampus under Stress Conditions. PhD thesis, Hebrew University in Jerusalem, Israel, 1994."},{"key":"12_CR12","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1016\/0893-6080(89)90003-8","volume":"2","author":"J.A. Franklin","year":"1989","unstructured":"J.A. Franklin. On the approximate realization of continuous mappings by neural networks. Neural Networks, 2:183\u2013192, 1989.","journal-title":"Neural Networks"},{"key":"12_CR13","first-page":"128","volume-title":"Progress In Neural Networks","author":"S. Franklin","year":"1990","unstructured":"S. Franklin and M. Garzon. Neural computability. In O. M. Omidvar, editor, Progress In Neural Networks, pages 128\u2013144. Ablex, Norwood, NJ, 1990."},{"key":"12_CR14","doi-asserted-by":"publisher","first-page":"631","DOI":"10.1109\/IJCNN.1989.118643","volume":"II","author":"M. Garzon","year":"1989","unstructured":"M. Garzon and S. Franklin. Neural computability. In Proc. 3rd Int. Joint Conf. Neural Networks, volume II, pages 631\u2013637, 1989.","journal-title":"Proc. 3rd Int. Joint Conf. Neural Networks"},{"key":"12_CR15","doi-asserted-by":"crossref","unstructured":"C.L. Giles, B.G. Horne, and T. Lin. Learning a class of large finite state machines with a recurrent neural network. Neural Networks, 1995. In press.","DOI":"10.1016\/0893-6080(95)00041-0"},{"key":"12_CR16","unstructured":"R. Hartley and H. Szu. A comparison of the computational power of neural network models. In Proc. IEEE Conf. Neural Networks, pages 17\u201322, 1987."},{"key":"12_CR17","volume-title":"Neural Networks: A Comprehensive Foundation","author":"S. Haykin","year":"1994","unstructured":"S. Haykin. Neural Networks: A Comprehensive Foundation. IEEE Press, New York, 1994."},{"key":"12_CR18","doi-asserted-by":"crossref","unstructured":"J.W. Hong. On connectionist models. On Pure and Applied Mathematics, 41, 1988.","DOI":"10.1002\/cpa.3160410701"},{"key":"12_CR19","unstructured":"J.E. Hopcroft and J.D. Ullman. Introduction to Automata Theory, Languages, and Computation. Addison-Wesley, 1979."},{"key":"12_CR20","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1016\/0893-6080(91)90009-T","volume":"4","author":"K. Hornik","year":"1991","unstructured":"K. Hornik. Approximation capabilities of multilayer feedforward networks. Neural Networks, 4:251\u2013257, 1991.","journal-title":"Neural Networks"},{"key":"12_CR21","doi-asserted-by":"publisher","first-page":"551","DOI":"10.1016\/0893-6080(90)90005-6","volume":"3","author":"K. Hornik","year":"1990","unstructured":"K. Hornik, M. Stinchcombe, and H. White. Universal approximation of an unknown mapping and its derivatives using multilayer feedforward networks. Neural Networks, 3:551\u2013560, 1990.","journal-title":"Neural Networks"},{"key":"12_CR22","doi-asserted-by":"crossref","unstructured":"R.M. Karp and R.J. Lipton. Some connections between uniform and nonuniform complexity classes. In Proceedings of 12th ACM Symp. on Theory of Computing, pages 302\u2013309, 1980.","DOI":"10.1145\/800141.804678"},{"key":"12_CR23","doi-asserted-by":"crossref","unstructured":"J. Kilian and H.T. Siegelmann. On the power of sigmoid neural networks. In Proc. Sixth ACM Workshop on Computational Learning Theory, Santa Cruz, July 1993.","DOI":"10.1145\/168304.168321"},{"key":"12_CR24","first-page":"38","volume":"16","author":"G.I. Kirienko","year":"1970","unstructured":"G.I. Kirienko. Sintez samokottektiruyshchikhsya skhem iz funktsionalnykh elementov dlya aluchava tastushchego chisla oshibok v skheme. Diskret. Anal., 16:38\u201343, 1970.","journal-title":"Diskret. Anal."},{"key":"12_CR25","doi-asserted-by":"publisher","first-page":"15","DOI":"10.1016\/0304-3975(87)90078-8","volume":"52","author":"K. Ko","year":"1987","unstructured":"K. Ko. On helping by robust oracle machines. Theoretical Computer Science, 52, 1987, 15\u201336.","journal-title":"Theoretical Computer Science"},{"key":"12_CR26","doi-asserted-by":"publisher","first-page":"113","DOI":"10.1016\/0304-3975(94)90229-1","volume":"132","author":"P. Koiran","year":"1994","unstructured":"P. Koiran, M. Cosnard, and M. Garzon. Computability with low-dimensional dynamical systems. Theoretical Computer Science, 132:113\u2013128, 1994.","journal-title":"Theoretical Computer Science"},{"key":"12_CR27","doi-asserted-by":"crossref","unstructured":"W. Maass, G. Schnitger, and E.D. Sontag. On the computational power of sigmoid versus boolean threshold circuits. In Proc. 32nd IEEE Symp. Foundations of Comp. Sci, pages 767\u2013776, 1991.","DOI":"10.1109\/SFCS.1991.185447"},{"key":"12_CR28","unstructured":"M. Matthews. On the uniform approximation of nonlinear discrete-time fading-memory systems using neural network models. Technical Report Ph.D. Thesis, ETH No. 9635, E.T.H. Zurich, 1992."},{"issue":"4","key":"12_CR29","doi-asserted-by":"publisher","first-page":"849","DOI":"10.1142\/S0218001493000431","volume":"7","author":"C.B. Miller","year":"1993","unstructured":"C.B. Miller and C.L. Giles. Experimental comparison of the effect of order in recurrent neural networks. International Journal of Pattern Recognition and Artificial Intelligence, 7(4):849\u2013872, 1993. Special Issue on Neural Networks and Pattern Recognition, editors: I. Guyon, P.S.P. Wang.","journal-title":"International Journal of Pattern Recognition and Artificial Intelligence"},{"key":"12_CR30","first-page":"477","volume":"7","author":"A. A. Muchnik","year":"1962","unstructured":"A. A. Muchnik and S. G. Gindikin. The completeness of a system made up of non-reliable elements realizing a function of algebraic logic. Soviet Phys. Dokl, 7:477\u2013479, 1962.","journal-title":"Soviet Phys. Dokl"},{"key":"12_CR31","doi-asserted-by":"crossref","unstructured":"P. Orponen. Neural networks and complexity theory. In Proc. 17th Symposium on Mathematical Foundations of Computer Science, pages 50\u201361, 1992.","DOI":"10.1007\/3-540-55808-X_5"},{"key":"12_CR32","first-page":"247","volume":"13","author":"S.I. Ortyukov","year":"1978","unstructured":"S.I. Ortyukov. Synthesis of asymptotically nonredundant self-correcting arrangements of unreliable functional elements. Problems Inform. Transmission, 13:247\u2013251, 1978.","journal-title":"Problems Inform. Transmission"},{"key":"12_CR33","doi-asserted-by":"crossref","unstructured":"I. Parberry. Circuit Complexity and Neural Networks. MIT Press, 1994.","DOI":"10.7551\/mitpress\/1836.001.0001"},{"key":"12_CR34","volume-title":"Introduction to Probabilistic Automata","author":"A. Paz","year":"1971","unstructured":"A. Paz. Introduction to Probabilistic Automata. Academic Press, New York, 1971."},{"key":"12_CR35","doi-asserted-by":"publisher","first-page":"194","DOI":"10.1109\/18.2628","volume":"34","author":"N. Pippenger","year":"1988","unstructured":"N. Pippenger. Reliable computation by formulae in the presence of noise. IEEE Trans. Inform. Theory, 34:194\u2013197, 1988.","journal-title":"IEEE Trans. Inform. Theory"},{"key":"12_CR36","doi-asserted-by":"publisher","first-page":"531","DOI":"10.1145\/65950.77248","volume":"36","author":"N. Pippenger","year":"1989","unstructured":"N. Pippenger. Invariance of complexity measure of networks with unreliable gates. J. ACM, 36:531\u2013539, 1989.","journal-title":"J. ACM"},{"key":"12_CR37","doi-asserted-by":"crossref","first-page":"311","DOI":"10.1090\/pspum\/050\/1067764","volume":"5","author":"N. Pippenger","year":"1990","unstructured":"N. Pippenger. Developments in: The synthesis of reliable organisms from unreliable components. In Proc. of symposia in pure mathematics, volume 5, pages 311\u2013324, 1990.","journal-title":"Proc. of symposia in pure mathematics"},{"key":"12_CR38","volume-title":"PhD thesis","author":"J. B. Pollack","year":"1987","unstructured":"J. B. Pollack. On Connectionist Models of Natural Language Processing. PhD thesis, Computer Science Dept, Univ. of Illinois, Urbana, 1987."},{"key":"12_CR39","volume-title":"Technical Report 91-09-01","author":"M. M. Polycarpou","year":"1991","unstructured":"M. M. Polycarpou and P.A. Ioannou. Identification and control of nonlinear systems using neural network models: Design and stability analysis. Technical Report 91-09-01, Department of EE\/Systems, USC, Los Angeles, Sept 1991."},{"key":"12_CR40","doi-asserted-by":"crossref","unstructured":"C. E. Shannon. A mathematical theory of communication. Bell System Tech J., pages 379\u2013423, 623\u2013656, 1948.","DOI":"10.1002\/j.1538-7305.1948.tb00917.x"},{"issue":"4","key":"12_CR41","doi-asserted-by":"publisher","first-page":"575","DOI":"10.1142\/S0129626496000510","volume":"6","author":"H. T. Siegelmann","year":"1996","unstructured":"H. T. Siegelmann. On nil: The software constructor of neural networks. Parallel Processing Letters, 6(4):575\u2013582, 1996.","journal-title":"Parallel Processing Letters"},{"issue":"6","key":"12_CR42","doi-asserted-by":"publisher","first-page":"77","DOI":"10.1016\/0893-9659(91)90080-F","volume":"4","author":"H. T. Siegelmann","year":"1991","unstructured":"H. T. Siegelmann and E. D. Sontag. Turing computability with neural nets. Appl. Math. Lett., 4(6):77\u201380, 1991.","journal-title":"Appl. Math. Lett."},{"key":"12_CR43","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1016\/0304-3975(94)90178-3","volume":"131","author":"H. T. Siegelmann","year":"1994","unstructured":"H. T. Siegelmann and E. D. Sontag. Analog computation via neural networks. Theoretical Computer Science, 131, 1994. 331\u2013360.","journal-title":"Theoretical Computer Science"},{"issue":"1","key":"12_CR44","doi-asserted-by":"publisher","first-page":"132","DOI":"10.1006\/jcss.1995.1013","volume":"50","author":"H. T. Siegelmann","year":"1995","unstructured":"H. T. Siegelmann and E. D. Sontag. On computational power of neural networks. J. Comp. Syst. Sci, 50(1): 132\u2013150, 1995. Previous version appeared in Proc. Fifth ACM Workshop on Computational Learning Theory, pages 440\u2013449, Pittsburgh, July 1992.","journal-title":"J. Comp. Syst. Sci"},{"key":"12_CR45","volume-title":"Technical Report UMIACS-TR-95-12 and CS-TR-3408","author":"H.T. Siegelmann","year":"1995","unstructured":"H.T. Siegelmann, B.G. Horne, and C.L. Giles. Computational capabilities of recurrent narx neural networks. Technical Report UMIACS-TR-95-12 and CS-TR-3408, Institute for Advanced Computer Studies, University of Maryland, College Park, Maryland, 1995."},{"key":"12_CR46","unstructured":"E.D. Sontag. Neural nets as systems models and controllers. In Proc. Seventh Yale Workshop on Adaptive and Learning Systems, pages 73\u201379, Yale University, 1992."},{"key":"12_CR47","volume-title":"Essays on Control: Perspectives in the Theory and its Applications","author":"E.D. Sontag","year":"1993","unstructured":"E.D. Sontag. Neural networks for control. In H.L. Trentelman and J.C. Willems, editors, Essays on Control: Perspectives in the Theory and its Applications. Birkhauser, Boston, 1993."},{"key":"12_CR48","doi-asserted-by":"crossref","unstructured":"M. Stinchcombe and H. White. Approximating and learning unknown mappings using multilayer feedforward networks with bounded weights. In Proceedings of the International Joint Conference on Neural Networks, IEEE, 1990.","DOI":"10.1109\/IJCNN.1990.137817"},{"key":"12_CR49","doi-asserted-by":"publisher","first-page":"589","DOI":"10.1016\/S0893-6080(05)80037-1","volume":"5","author":"H.J. Sussmann","year":"1992","unstructured":"H.J. Sussmann. Uniqueness of the weights for minimal feedforward nets with a given input-output map. Neural Networks, 5:589\u2013593, 1992.","journal-title":"Neural Networks"},{"key":"12_CR50","doi-asserted-by":"publisher","first-page":"558","DOI":"10.1007\/BF01152835","volume":"15","author":"D. Ulig","year":"1974","unstructured":"D. Ulig. On the synthesis of self-correcting schemes from functional elements with a small numer of reliable elements. Math. Notes. Acad. Sci. USSR, 15:558\u2013562, 1974.","journal-title":"Math. Notes. Acad. Sci. USSR"},{"key":"12_CR51","volume-title":"Automata Studies","author":"J. von Neumann","year":"1956","unstructured":"J. von Neumann. Probabilistic, logics and the synthesis of reliable organisms from unreliable components. In C.E. Shannon and J. McCarthy, editors, Automata Studies. Princeton U. Press, Princeton, NJ, 1956."},{"key":"12_CR52","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/2946.001.0001","volume-title":"Extrapolation, interpolation, and smoothing of stationary time series","author":"N. Wiener","year":"1949","unstructured":"N. Wiener. Extrapolation, interpolation, and smoothing of stationary time series. MIT Press, Cambridge, MA, 1949."},{"key":"12_CR53","unstructured":"D. Wolpert. A computationally universal field computer which is purely linear. Technical Report LA-UR-91-2937, Los Alamos National Laboratory, 1991."},{"key":"12_CR54","doi-asserted-by":"publisher","first-page":"143","DOI":"10.1016\/S0019-9958(82)80019-3","volume":"54","author":"S. Zachos","year":"1982","unstructured":"S. Zachos. Robustness of probabilistic computational complexity classes under definitional perturbations. Information and Control, 54:143\u2013154, 1982.","journal-title":"Information and Control"}],"container-title":["Lecture Notes in Computer Science","Adaptive Processing of Sequences and Data Structures"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/BFb0054004","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,9]],"date-time":"2025-01-09T07:14:25Z","timestamp":1736406865000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/BFb0054004"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998]]},"ISBN":["9783540643418","9783540697527"],"references-count":54,"URL":"https:\/\/doi.org\/10.1007\/bfb0054004","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[1998]]},"assertion":[{"value":"25 May 2006","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}