"No-Free-Lunch Result for Interval and Fuzzy Computing: When Bounds Are" by Ildar Batyrshin, Martine Ceberio et al.

Skip to main content

Departmental Technical Reports (CS)

Title

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

Authors

Ildar Batyrshin, Instituto Mexicano de Petróleo
Martine Ceberio, University of Texas at El PasoFollow
Vladik Kreinovich, University of Texas at El PasoFollow

Publication Date

9-2011

Comments

Technical Report: UTEP-CS-11-31b

To appear in: I. Batyrshin and G. Sidorov (eds.), Proceedings of the 10th Mexican International Conference on Artificial Intelligence MICAI'2011, Puebla, Mexico, November 26 - December 4, 2011, Springer Lecture Notes in Artificial Intelligence, Vol. 7095, pp. 13-23.

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.

tr11-31.pdf (88 kB)
Original file: CS-UTEP-11-31

Find in your library

Included in

Computer Engineering Commons

COinS