On digital nondeterminism

Mathematical Systems Theory

Volumn 29, Issue 6, 1996, Pages 635-647

  Cucker, F ^a   Matamala, M ^b  

^a UNIVERSITAT POMPEU FABRA   (Spain)

^b UNIVERSITY OF CHILE   (Chile)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 33751242490     PISSN: 00255661     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf01301968     Document Type: Article

References (18)

1. J. L. Balcázar, J. Díaz, and J. Gabarró. Structural Complexity I. EATCS Monographs on Theoretical Computer Science, vol. 11. Springer-Verlag, 1988.
2. E. Bienenstock, F. Fogelman-Soulie, and G. Weisbuch, eds. Disordered Systems and Biological Organization. NATO ASI, Series F: Computer and System Sciences. Springer-Verlag, 1986.
3. 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. Bulletin of the American Mathematical Society, 21(1): 1-46, 1989.
4. R. Journal of Complexity, 8:230-238, 1992.
5. F. Cucker. On the complexity of quantifier elimination: The structural approach. The Computer Journal, 36(5):400-408, 1993.
6. F. Cucker and A. Torrecillas. Two P-complete problems in the theory of the reals. Journal of Complexity, 8:454-466, 1992.
7. D. P. Dobkin and R. J. Lipton. On the complexity of computations under varying sets of primitives. Journal of Computer and System Sciences, 18:86-91, 1979.
8. J. B. Goode. Accessible telephone directories. Journal of Symbolic Logic, 59(1):92-105, 1994.
9. J. J. Hopfield. Neural networks and physical systems with emergent collective computational abilities. In Proceedings of the National Academy of Sciences, USA, vol. 79, pages 2554-2558, 1982.
10. J. J. Hopfield and D. W. Tank. Neural computation of decisions in optimization problems. Biology Cybernetics, 52:141-152, 1985.
11. N. D. Jones and W. T. Laaser. Complete problems for deterministic polynomial time. Theoretical Computer Science, 3:105-117, 1977.
12. P. Koiran. Puissance de calcul des réseaux de neurones artificiels. PhD thesis. École Normale Supérieure de Lyon, June 1993.
13. W. Maass. Bounds for the computational power and learning complexity of analog neural nets. In Proceedings of the 25th STOC, pages 335-344, 1993.
14. K. Meer. A note on a P ν NP result for a restricted class of real machines. Journal of Complexity, 8:451-453, 1992.
15. C. Michaux. Une remarque à propos des machines sur R introduites par Blum, Shub et Smale. C. R. Academie Science Paris, 309, Série 1:435-137, 1989.
16. H. T. Siegelmann and E. D. Sontag. Analog computation via neural networks. Theoretical Computer Science, 131(2):331-360, 1994.
17. J. von zur Gathen. Algebraic complexity theory. Annual Review of Computer Science, 3:317-347, 1988.
18. X. D. Zhang. Complexity of neural networks learning in the real number model. Technical Report. University of Massachusets at Amherst, 1992.