Abstract
One of the main problems of interval computations is computing the range of a given function over given intervals. It is known that there is a general algorithm for computing the range of computable functions over computable intervals. However, if we take into account that often in practice, not all possible combinations of the inputs are possible (i.e., that there are constraints), then it becomes impossible to have an algorithm which would always compute this range. In this paper, we explain that the main reason why range estimation under constraints is not always computable is that constraints may introduce discontinuity—and all computable functions are continuous. Specifically, we show that if we restrict ourselves to computably continuous constraints, the problem of range estimation under constraints remains computable.
Keywords
- Range Estimation Problem
- Computable Function
- Feasible Algorithm
- Uncertainty Interval
- Hardware Limitations
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
References
Ceberio, M., Kreinovich, V. (eds.): Constraint Programming and Decision Making. Springer, Heidelberg (2014)
Kreinovich, V., Kubica, B.: From computing sets of optima, Pareto sets, and sets of Nash equilibria to general decision-related set computations. J. Univers. Comput. Sci. 16(18), 2657–2685 (2010)
Kreinovich, V., Lakeyev, A., Rohn, J., Kahl, P.: Computational Complexity And Feasibility Of Data Processing And Interval Computations. Kluwer, Dordrecht (1997)
Moore, R. E., Kearfott, R. B., Cloud, M. J.: Introduction to Interval Analysis, SIAM Press (2009)
Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)
Acknowledgements
This work was supported in part by the National Science Foundation grants HRD-0734825, HRD-124212, and DUE-0926721.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2018 Springer International Publishing AG
About this chapter
Cite this chapter
Ceberio, M., Kosheleva, O., Kreinovich, V. (2018). Range Estimation Under Constraints Is Computable Unless There Is a Discontinuity. In: Ceberio, M., Kreinovich, V. (eds) Constraint Programming and Decision Making: Theory and Applications. Studies in Systems, Decision and Control, vol 100. Springer, Cham. https://doi.org/10.1007/978-3-319-61753-4_6
Download citation
DOI: https://doi.org/10.1007/978-3-319-61753-4_6
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-61752-7
Online ISBN: 978-3-319-61753-4
eBook Packages: EngineeringEngineering (R0)