Skip to main content
SpringerLink
Log in

On digital nondeterminism

  • Published:
Mathematical systems theory Aims and scope Submit manuscript

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

References

  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.

    Article  MATH  MathSciNet  Google Scholar 

  4. F. Cucker. Pℝ ≠ NCℝ.Journal of Complexity, 8:230–238, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  5. F. Cucker. On the complexity of quantifier elimination: The structural approach.The Computer Journal, 36(5):400–408, 1993.

    Article  MATH  MathSciNet  Google Scholar 

  6. F. Cucker and A. Torrecillas. Two P-complete problems in the theory of the reals.Journal of Complexity, 8:454–466, 1992.

    Article  MATH  MathSciNet  Google Scholar 

  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.

    Article  MATH  MathSciNet  Google Scholar 

  8. J. B. Goode. Accessible telephone directories.Journal of Symbolic Logic, 59(1):92–105, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  9. J. J. Hopfield. Neural networks and physical systems with emergent collective computational abilities. InProceedings 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.

    MATH  MathSciNet  Google Scholar 

  11. N. D. Jones and W. T. Laaser. Complete problems for deterministic polynomial time.Theoretical Computer Science, 3:105–117, 1977.

    Article  MATH  MathSciNet  Google Scholar 

  12. P. Koiran.Puissance de calcul des reseaux 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. InProceedinmgs 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.

    Article  MATH  MathSciNet  Google Scholar 

  15. C. Michaux. Une remarque a propos des machines sur ℝ introduites par Blum, Shub et Smale.C. R. Academic Science Paris, 309, Série 1:435–437, 1989.

    MATH  MathSciNet  Google Scholar 

  16. H. T. Siegelmann and E. D. Sontag. Analog computation via neural networks.Theoretical Computer Science, 131(2):331–360, 1994.

    Article  MATH  MathSciNet  Google Scholar 

  17. J. von zur Gathen. Algebraic complexity theory.Annual Review of Computer Science, 3:317–347, 1988.

    Article  Google Scholar 

  18. X. D. Zhang. Complexity of neural networks learning in the real number model. Technical Report. University of Massachusets at Amherst, 1992.

Download references

Author information

Authors and Affiliations

  1. Departament d'Economia, Universitat Pompeu Fabra, Balmes 132, 08008, Barcelona, Spain

    F. Cucker

  2. Departamento Ing. Matematica, Universidad de Chile, Beaucheff 850, casilla 170-correo 3, Santiago, Chile

    M. Matamala

Authors
  1. F. Cucker
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. M. Matamala
    View author publications

    You can also search for this author in PubMed Google Scholar

Additional information

F. Cucker was partially supported by DGICyT PB 920498 and the ESPRIT BRA Program of the EC under Contract Nos. 7141 and 8556, projects ALCOM II and NeuroCOLT. M. Matamala was partially supported by Grant Marie Curie CEE ERBCISTGT 920031.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Cucker, F., Matamala, M. On digital nondeterminism. Math. Systems Theory 29, 635–647 (1996). https://doi.org/10.1007/BF01301968

Download citation

  • Received:

  • Revised:

  • Issue Date:

  • DOI: https://doi.org/10.1007/BF01301968

Keywords

Search

Navigation