Skip to main content
Log in

Hilbert Problems (Almost) 100 Years Later (From the Viewpoint of Interval Computations)

  • Published:
Reliable Computing

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

Access this article

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

Instant access to the full article PDF.

Institutional subscriptions

References

  1. Aberth, O.: Precise Numerical Analysis, Wm. C. Brown Publishers, Dubuque, Iowa, 1988.

    Google Scholar 

  2. Beeson, M. J.: Foundations of Constructive Mathematics, Springer-Verlag, N. Y., 1985.

    Google Scholar 

  3. Bishop, E.: Foundations of Constructive Analysis, McGraw-Hill, 1967.

  4. Bishop, E. and Bridges, D. S.: Constructive Analysis, Springer, N.Y., 1985.

    Google Scholar 

  5. Bridges, D. S.: Constructive Functional Analysis, Pitman, London, 1979.

    Google Scholar 

  6. Browder, F. E. (ed.): Mathematical Developments Arising from Hilbert's Problems, Proceedings of Symposia in Pure Mathematics, Vol. 28, American Mathematical Society, Providence, RI, 1976.

  7. Davis, M., Matiyasevich, Yu. V., and Robinson, J.: Hilbert's Tenth Problem. Diophantine Equations: Positive Aspects of a Negative Solution, [6], Part 2, pp. 323–378.

  8. Delzell, C. N.: Kreisel's Unwinding of Artin's Proof, in: Odifreddi, P., Kreiseliana, A. K. Peters, Wesseley, MA, 1996, pp. 113–246.

    Google Scholar 

  9. Feferman, S.: Kreisel's 'Unwinding' Program, in: Odifreddi, P., Kreiseliana, A. K. Peters, Wesseley, MA, 1996, pp. 247–273.

    Google Scholar 

  10. Frisch, H. L., Borzi, C., Ord, G., Percus, J. K., and Williams, G. O.: Approximate Representation of Functions of Several Variables in Terms of Functions of One Variable, Physical Review Letters 63(9) (1989), pp. 927–929.

    Google Scholar 

  11. Hecht-Nielsen, R.: Kolmogorov's Mapping Neural Network Existence Theorem, in: IEEE International Conference on Neural Networks, San Diego, SOS Printing, 1987, Vol. 2, pp. 11–14.

    Google Scholar 

  12. Hilbert, D.: Mathematical Problems, Lecture Delivered Before the Int'l Congress of Mathematics in Paris in 1900, translated in Bull. Amer. Math. Soc. 8 (1902), pp. 437–479; reprinted in [6].

    Google Scholar 

  13. Kolmogorov, A. N.: On the Representation of Continuous Functions of Several Variables by Superposition of Continuous Functions of One Variable and Addition, Dokl. Akad. Nauk SSSR 114 (1957), pp. 369–373.

    Google Scholar 

  14. Kosheleva, O. M.: Axiomatization of Volume in Elementary Geometry, Siberian Mathematical Journal 21(1) (1980), pp. 106–114 (in Russian); English translation: Siberian Mathematical Journal 21 (1980), pp. 78–85.

    Google Scholar 

  15. Kreisel, G.: Hilbert's 17th Problem, I and II, Bull. Amer. Math. Soc. 63 (1957), p. 99.

    Google Scholar 

  16. Kreisel, G.: Sums of Squares, in: Summaries of the Talks, Summer Institute Symbolic Logic, 1957, Cornell University, Inst. Defense Analysis, Princeton, 1960, pp. 313–320.

    Google Scholar 

  17. Kurkova, V.: Kolmogorov's Theorem Is Relevant, Neural Computation 3 (1991), pp. 617–622.

    Google Scholar 

  18. Kurkova, V.: Kolmogorov's Theorem and Multilayer Neural Networks, Neural Networks 5 (1993), pp. 501–506.

    Google Scholar 

  19. Kushner, B. A.: Lectures on Constructive Mathematical Analysis, Translations of Mathematical Monographs, Vol. 60, American Mathematical Society, Providence, RI, 1984.

    Google Scholar 

  20. Luckhardt, H.: Bounds Extracted by Kreisel from Ineffective Proofs, in: Odifreddi, P., Kreiseliana, A. K. Peters, Wesseley, MA, 1996, pp. 289–300.

    Google Scholar 

  21. Matiyasevich, Yu. V.: Enumerable Sets Are Diophantine, Soviet Math. Doklady 11 (1970), pp. 354–357.

    Google Scholar 

  22. Mines, R., Nakamura, M., and Kreinovich, V.: Constructive Proof of Kolmogorov's Theorem, Neural Networks and Intervals, in: Abstracts for a Workshop on Interval Methods in International Conference on Interval Computations, Lafayette, LA, February 25–March 1, 1993, pp. 24–25.

  23. Nakamura, M., Mines, R., and Kreinovich, V.: Guaranteed Intervals for Kolmogorov's Theorem (and Their Possible Relation to Neural Networks), Interval Computations 3 (1993), pp. 183–199.

    Google Scholar 

  24. Ness, M.: Approximative Versions of Kolmogorov's Superposition Theorem, Proved Constructively, J. Comput. Appl. Math. (1994).

  25. Nesterov, V. M.: Interval Analogues of Hilbert's 13th Problem, in: Abstracts of the Int'l Conference Interval'94, St. Petersburg, Russia, March 7–10, 1994, pp. 185–186.

  26. Nguyen, H. T. and Kreinovich, V.: Nested Intervals and Sets: Concepts, Relations to Fuzzy Sets, and Applications, in: Kearfott, R. B. et al. (eds), Applications of Interval Computations, Kluwer, Dordrecht, 1996, pp. 245–290.

    Google Scholar 

  27. Nguyen, H. T. and Kreinovich, V.: Kolmogorov's Theorem and Its Impact on Soft Computing, in: Yager, R. R. and Kacprzyk, J., The Ordered Weighted Averaging Operators: Theory and Applications, Kluwer, Boston, MA, 1997, pp. 3–17.

    Google Scholar 

  28. Nguyen, H. T., Kreinovich, V., Nesterov, V., and Nakamura, M.: On Hardware Support for Interval Computations and for Soft Computing: A Theorem, IEEE Transactions on Fuzzy Systems 5(1) (1997), pp. 108–127.

    Google Scholar 

  29. Nguyen, H. T., Kreinovich, V., and Sprecher, D.: Normal Forms for Fuzzy Logic—an Application of Kolmogorov's Theorem, International Journal on Unicertainty, Fuzziness, and Knowledge-Based Systems 4(4) (1996), pp. 331–349.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

About this article

Cite this article

Kosheleva, O.M. Hilbert Problems (Almost) 100 Years Later (From the Viewpoint of Interval Computations). Reliable Computing 4, 399–403 (1998). https://doi.org/10.1023/A:1024480119433

Download citation

  • Issue Date:

  • DOI: https://doi.org/10.1023/A:1024480119433

Keywords

Navigation