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. © 2011 Springer-Verlag.
Cite
CITATION STYLE
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 Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 7095 LNAI, pp. 13–23). https://doi.org/10.1007/978-3-642-25330-0_2
Register to see more suggestions
Mendeley helps you to discover research relevant for your work.
