On the Effect of Analog Noise in Discrete-Time Analog Computations

Neural Computation

Volumn 10, Issue 5, 1998, Pages 1071-1095

  Maass, Wolfgang ^a   Orponen, Pekka ^b  

^a GRAZ UNIVERSITY OF TECHNOLOGY   (Austria)

^b UNIVERSITY OF JYVÄSKYLÄ   (Finland)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0001243798     PISSN: 08997667     EISSN: None     Source Type: Journal    
DOI: 10.1162/089976698300017359     Document Type: Article

References (36)

1. Alon, N., Dewdney, A. K., & Ott, T. J. (1991). Efficient simulation of finite automata by neural nets. J. Assoc. Comput. Mach., 38, 495-514.
2. Alon, N., Cesa-Bianchi, N., Ben-David, S., & Haussler, D. (1993). Scale-sensitive dimensions, uniform convergence, and learnability. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (pp. 292-301). New York: IEEE Computer Science Press.
3. Anderson, J. A., Silverstein, J. W., Ritz, S. A., & Jones, R. S. (1988). Distinctive features, categorical perception, and probability learning: Some applications of a neural model. In J. A. Anderson & E. Rosenfeld (Eds.), Neurocomputing: Foundations of research. Cambridge, MA: MIT Press.
4. Asarin, E., & Maler, O. (1994). On some relations between dynamical systems and transition systems. In Proceedings of the 21st International Colloquium on Automata, Languages, and Programming (pp. 59-72). Lecture Notes in Computer Science 820. Berlin: Springer-Verlag.
5. Blum, L., Shub, M., & Smale, S. (1989). On a theory of computation over the real numbers: NP-completeness, recursive functions and universal machines. Bulletin of the Amer. Math. Soc., 21, 1-46.
6. Blumer, A., Ehrenfeucht, A., Haussler, D., & Warmuth, M. K. (1989). Learnability and the Vapnik-Chervonenkis dimension. J. Assoc. Comput. Mach., 36, 929-965.
7. Casey, M. (1996). The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction. Neural Computation, 8(6), 1135-1178.
8. Cowan, J. D. (1966). Synthesis of reliable automata from unreliable components. In E. R. Caianiello (Ed.), Automata theory (pp. 131-145). New York: Academic Press.
9. Feller, W. (1971). An introduction to probability theory and its applications (2nd ed.). New York: Wiley.
10. Frasconi, P., Gori, M., Maggini, M., & Soda, G. (1996). Representation of finite state automata in recurrent radial basis function networks. Machine Learning, 23, 5-32.
11. Gál, A. (1991). Lower bounds for the complexity of reliable boolean circuits with noisy gates. In Proceedings of the 32th Annual IEEE Symposium on Foundations of Computer Science (pp. 594-601). New York: IEEE Computer Science Press.
12. Gerstner, W., & van Hemmen, J. L. (1994). How to describe neuronal activity: Spikes, rates or assemblies? In J. D. Cowan, G. Tesauro, & J. Alspector (Eds.), Advances in neural information processing systems, 6 (pp. 463-470). San Mateo, CA: Morgan Kaufmann.
13. Goldberg, P. W., & Jerrum, M. R. (1995). Bounding the Vapnik-Chervonenkis dimension of concept classes parameterized by real numbers. Machine Learning, 18, 131-148.
14. Haussler, D. (1992). Decision theoretic generalizations of the PAC-model for neural nets and other learning applications. Information and Computation, 100, 78-150.
15. Hopcroft, J. E., & Ullman, J. D. (1979). Introduction to automata theory, languages, and computation. Reading, MA: Addison-Wesley.
16. Horne, B. G., & Hush, D. R. (1996). Bounds on the complexity of recurrent neural network implementations of finite state machines. Neural Networks, 9, 243-252.
17. Indyk, P. (1995). Optimal simulation of automata by neural nets. In Proceedings of the 12th Annual Symposium on Theoretical Aspects of Computer Science (pp. 337-347). Lecture Notes in Computer Science 900. Berlin: Springer-Verlag.
18. Karpinski, M., & Macintyre, A. (1997). Polynomial bounds for VC-dimension of sigmoidal and general Pfaffian neural networks. J. Computer and System Sciences, 54, 169-179.
19. Kifer, Y. (1988). Random perturbations of dynamical systems. Boston: Birkhäuser.
20. Koiran, P. (1993). A weak version of the Blum, Shub and Smale model. In Proceedings of the 34th Annual IEEE Symposium on Foundations of Computer Science (pp. 486-495). New York: IEEE Computer Science Press.
21. Koiran, P., Cosnard, M., & Garzon, M. (1994). Computability with low-dimensional dynamical systems. Theoret. Comput. Sci., 132, 113-128.
22. Maass, W. (1995). Vapnik-Chervonenkis dimension of neural nets. In M. A. Arbib (Ed.), The handbook of brain theory and neural networks (pp. 1000-1003). Cambridge, MA: MIT Press.
23. Maass, W. (1996). Lower bounds for the computational power of networks of spiking neurons. Neural Computation, 8, 1-40.
24. Maass, W. (1997). Fast sigmoidal networks via spiking neurons. Neural Computation, 9, 279-304.
25. Minsky, M. L. (1972). Computation: Finite and infinite machines. Englewood Cliffs, NJ: Prentice Hall.
26. Moore, C. (1990). Unpredictability and undecidability in physical systems. Phys. Review Letters, 64, 2354-2357.
27. Omlin, C. W., & Giles, C. L. (1996). Constructing deterministic finite-state automata in recurrent neural networks. J. Assoc. Comput. Mach., 43, 937-972.
28. Orponen, P., & Matamala, M. (1996). Universal computation by finite two-dimensional coupled map lattices. In Proceedings of the Workshop on Physics and Computation, PhysComp'96 (pp. 243-247). Boston: New England Complex Systems Institute.
29. Phatak, D. S., & Koren, I. (1995). Complete and partial fault tolerance of feed-forward neural nets. IEEE Transactions on Neural Networks, 6, 446-456.
30. Pippenger, N. (1989). Invariance of complexity measures for networks with unreliable gates. J. Assoc. Comput. Mach., 36, 531-539.
31. Rabin, M. (1963). Probabilistic automata. Information and Control, 6, 230-245.
32. Siegelmann, H. T. (1994). On the computational power of probabilistic and faulty networks. In Proceedings of the 21st International Colloquium on Automata, Languages, and Programming (pp. 23-34). Lecture Notes in Computer Science 820. Berlin: Springer-Verlag.
33. Siegelmann, H. T., & Sontag, E. D. (1991). Turing computability with neural nets. Appl. Math. Letters, 4(6), 77-80.
34. Turán, G., & Vatan, F. (1994). On the computation of boolean functions by analog circuits of bounded fan-in. In Proceedings of the 35th Annual IEEE Symposium on Foundations of Computer Science (pp. 553-564). New York: IEEE Computer Science Press.
35. Vapnik, V. N., & Chervonenkis, A. Y. (1971). On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and Its Applications, 16, 264-280.
36. von Neumann, J. (1956). Probabilistic logics and the synthesis of reliable organisms from unreliable components. In C. E. Shannon & J. E. McCarthy (Eds.), Automata studies (pp. 329-378). Annals of Mathematics Studies 34. Princeton, NJ: Princeton University Press.