Skip to main content
SpringerLink
Log in
Book cover

Mexican International Conference on Artificial Intelligence

MICAI 2011: Advances in Soft Computing pp 13–23Cite as

No-Free-Lunch Result for Interval and Fuzzy Computing: When Bounds Are Unusually Good, Their Computation Is Unusually Slow

  • Conference paper

  • 879 Accesses

Part of the book series: Lecture Notes in Computer Science ((LNAI,volume 7095))

Abstract

On several examples from interval and fuzzy computations and from related areas, we show that when the results of data processing are unusually good, their computation is unusually complex. This makes us think that there should be an analog of Heisenberg’s uncertainty principle well known in quantum mechanics: when we an unusually beneficial situation in terms of results, it is not as perfect in terms of computations leading to these results. In short, nothing is perfect.

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

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Dubois, D., Prade, H.: Operations on fuzzy numbers. International Journal of Systems Science 9, 613–626 (1978)

    Article  MathSciNet  MATH  Google Scholar 

  2. Ferson, S., Ginzburg, L., Kreinovich, V., Longpré, L., Aviles, M.: Computing variance for interval data is NP-hard. ACM SIGACT News 33(2), 108–118 (2002)

    Article  Google Scholar 

  3. Ferson, S., Ginzburg, L., Kreinovich, V., Longpré, L., Aviles, M.: Exact bounds on finite populations of interval data. Reliable Computing 11(3), 207–233 (2005)

    Article  MathSciNet  MATH  Google Scholar 

  4. Ferson, S., Kreinovich, V., Hajagos, J., Oberkampf, W., Ginzburg, L.: Experimental Uncertainty Estimation and Statistics for Data Having Interval Uncertainty, Sandia National Laboratories, Report SAND2007-0939 (May 2007)

    Google Scholar 

  5. Griewank, A., Walter, A.: Evaluating Derivatives: Principles and Techniques of Algorithmic Differentiation. SIAM Publ., Philadelphia (2008)

    Book  MATH  Google Scholar 

  6. Interval computations website, http://www.cs.utep.edu/interval-comp

  7. Jaulin, L., Kieffer, M., Didrit, O., Walter, E.: Applied Interval Analysis, with Examples in Parameter and State Estimation. In: Robust Control and Robotics. Springer, London (2001)

    Google Scholar 

  8. Klir, G., Yuan, B.: Fuzzy Sets and Fuzzy Logic. Prentice Hall, Upper Saddle River (1995)

    MATH  Google Scholar 

  9. Kreinovich, V., Ferson, S.: A new Cauchy-based black-box technique for uncertainty in risk analysis. Reliability Engineering and Systems Safety 85(1–3), 267–279 (2004)

    Article  Google Scholar 

  10. Kreinovich, V., Longpré, L., Starks, S.A., Xiang, G., Beck, J., Kandathi, R., Nayak, A., Ferson, S., Hajagos, J.: Interval versions of statistical techniques, with applications to environmental analysis, bioinformatics, and privacy in statistical databases. Journal of Computational and Applied Mathematics 199(2), 418–423 (2007)

    Article  MathSciNet  MATH  Google Scholar 

  11. Kreinovich, V., Xiang, G., Starks, S.A., Longpré, L., Ceberio, M., Araiza, R., Beck, J., Kandathi, R., Nayak, A., Torres, R., Hajagos, J.: Towards combining probabilistic and interval uncertainty in engineering calculations: algorithms for computing statistics under interval uncertainty, and their computational complexity. Reliable Computing 12(6), 471–501 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  12. Kreinovich, V., Xiang, G.: Fast algorithms for computing statistics under interval uncertainty: an overview. In: Huynh, V.-N., Nakamori, Y., Ono, H., Lawry, J., Kreinovich, V., Nguyen, H.T. (eds.) Interval/Probabilistic Uncertainty and Non-Classical Logics, pp. 19–31. Springer, Heidelberg (2008)

    Chapter  Google Scholar 

  13. Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P.: Computational Complexity and Feasibility of Data Processing and Interval Computations. Kluwer, Dordrecht (1997)

    MATH  Google Scholar 

  14. Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, Heidelberg (2008)

    Book  MATH  Google Scholar 

  15. Moore, R.E., Kearfott, R.B., Cloud, M.J.: Introduction to Interval Analysis. SIAM Press, Philadelphia (2009)

    Book  MATH  Google Scholar 

  16. Nguyen, H.T., Kreinovich, V.: Nested intervals and sets: concepts, relations to fuzzy sets, and applications. In: Kearfott, R.B., Kreinovich, V. (eds.) Applications of Interval Computations, pp. 245–290. Kluwer, Dordrecht (1996)

    Chapter  Google Scholar 

  17. Nguyen, H.T., Walker, E.A.: A First Course in Fuzzy Logic. Chapman & Hall/CRC, Boca Raton (2006)

    MATH  Google Scholar 

  18. Rabinovich, S.: Measurement Errors and Uncertainties: Theory and Practice. Springer, New York (2005)

    MATH  Google Scholar 

  19. Trejo, R., Kreinovich, V.: Error estimations for indirect measurements: randomized vs. deterministic algorithms for ‘black-box’ programs. In: Rajasekaran, S., Pardalos, P., Reif, J., Rolim, J. (eds.) Handbook on Randomized Computing, pp. 673–729. Kluwer (2001)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Computer Science Dept., University of Texas at El Paso, El Paso, TX, 79968, USA

    Martine Ceberio & Vladik Kreinovich

Authors
  1. Martine Ceberio
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Vladik Kreinovich
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Mexican Petroleum Institute (IMP), Eje Central Lazaro Cardenas Norte, 152, Col. San Bartolo Atepehuacan, CP 07730, Mexico DF, Mexico

    Ildar Batyrshin

  2. National Polytechnic Institute (IPN), Center for Computing Research (CIC), Av. Juan Dios Bátiz, s/n, Col. Nueva Industrial Vallejo, CP 07738, Mexico D.F., Mexico

    Grigori Sidorov

Rights and permissions

Reprints and permissions

Copyright information

© 2011 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Ceberio, M., Kreinovich, V. (2011). No-Free-Lunch Result for Interval and Fuzzy Computing: When Bounds Are Unusually Good, Their Computation Is Unusually Slow. In: Batyrshin, I., Sidorov, G. (eds) Advances in Soft Computing. MICAI 2011. Lecture Notes in Computer Science(), vol 7095. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-25330-0_2

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-25330-0_2

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-25329-4

  • Online ISBN: 978-3-642-25330-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation