On the effect of analog noise in discrete-time analog computations

Advances in Neural Information Processing Systems

Volumn , Issue , 1997, Pages 218-224

  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

COMPUTATIONAL METHODS; NEURAL NETWORKS;

ANALOG COMPUTATION; ANALOG NOISE; COMPUTATIONAL MODEL; DISCRETE TIME; SPIKING NEURON; UPPER BOUND; VC-DIMENSION;

ANALOG COMPUTERS;

EID: 84899000007     PISSN: 10495258     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (11)

1. L. Blum, M. Shub, S. Smale, On a theory of computation over the real numbers: NP-eompleteness, recursive functions and universal machines. Bulletin of the Amer. Math. Soc. 21 (1989), 1-46.
2. M. Casey, The dynamics of discrete-time computation, with application to recurrent neural networks and finite state machine extraction. Neural Computation 8 (1996), 1135-1178.
3. J. D. Cowan, Synthesis of reliable automata from unreliable components. Automata Theory (E. R. Caianiello, ed.), 131-145. Academic Press, New York, 1966.
4. W. Maass, Lower bounds for the computational power of networks of spiking neurons. Neural Computation 8 (1996), 1-40.
5. W. Maass, Fast sigmoidal networks via spiking neurons, to appear in Neural Computation 9, 1997. FTP-host: archive.cis.ohio-state.edu, FTP-filename: /pub/neuroprose /maass.sigmoidal-spiking.ps.Z.
6. W. Maass, P. Orponen, On the effect of analog noise in discrete-time analog computations (journal version), submitted for publication; see http://www.math.jyu.fi/~orponen/papers/noisyac.ps.
7. N. Pippenger, Invariance of complexity measures for networks with unreliable gates. J. Assoc. Comput. Mach. 86 (1989), 531-539.
8. M. Rabin, Probabilistic automata. Information and Control 6 (1963), 230-245.
9. H. T. Siegelmann, On the computational power of probabilistic and faulty networks. Proc. 21st International Colloquium on Automata, Languages, and Programming, 23-34. Lecture Notes in Computer Science 820, Springer-Verlag, Berlin, 1994.
10. H. T. Siegelmann, E. D. Sontag, Turing computability with neural nets. Appl. Math. Letters 4(6) (1991), 77-80.
11. J. von Neumann, Probabilistic logics and the synthesis of reliable organisms from unreliable components. Automata Studies (C. E. Shannon, J. E. McCarthy, eds.), 329-378. Annals of Mathematics Studies 34, Princeton University Press, Princeton, NJ, 1956.