Abstract
Applications of interval computations usually assume that while we only know an interval containing the actual (unknown) value of a physical quantity, there is the exact value of this quantity, and that in principle, we can get more and more accurate estimates of this value. Physicists know, however, that, due to the uncertainty principle, there are limitations on how accurately we can measure the values of physical quantities. One of the important principles of modern physics is operationalism – that a physical theory should only use observable properties. This principle is behind most successes of the 20th century physics, starting with relativity theory (vs. un-observable aether) and quantum mechanics. From this viewpoint, it is desirable to avoid using un-measurable exact values and to modify the mathematical formalisms behind physical theories so that they explicitly only take objective uncertainty into account. In this paper, we describe how this can be done for objective interval uncertainty.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
References
Cheu, D., Longpré, L.: Towards the possibility of objective interval uncertainty in physics. Reliable Comput. 15(1), 43–49 (2011)
Feynman, R., Leighton, R., Sands, M.: The Feynman Lectures on Physics. Addison Wesley, Boston (2005)
Gorban, I.I.: Theory of Hyper-Random Phenomena. Ukrainian National Academy of Sciences Publ., Kyiv (2007). in Russian
Gorban, I.I.: Hyper-random phenomena: definition and description. Inf. Theor. Appl. 15(3), 203–211 (2008)
Kosheleva, O., Zakharevich, M., Kreinovich, V.: If many physicists are right and no physical theory is perfect, then by using physical observations, we can feasibly solve almost all instances of each NP-complete problem. Math. Struct. Model. 31, 4–17 (2014)
Kreinovich, V., Longpré, L.: Pure quantum states are fundamental, mixtures (composite states) are mathematical constructions: an argument using algorithmic information theory. Int. J. Theoret. Phys. 36(1), 167–176 (1997)
Li, M., Vitányi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer, Heidelberg (2008)
Longpré, L., Kreinovich, V.: When are two wave functions distinguishable: a new answer to Pauli’s question, with potential application to quantum cosmology. Int. J. Theoret. Phys. 47(3), 814–831 (2008)
Oxtoby, J.C.: Measure and Category: A Survey of the Analogies Between Topological and Measure Spaces. Springer, Heidelberg (1980)
Papadimitriou, C.: Computational Complexity. Addison Welsey, Reading (1994)
Wester, M.E., et al.: Atomic weights of the elements 2011 (IUPAC Technical Report). Pure Appl. Chem. 85(5), 1047–1078 (2013)
Acknowledgments
This work was supported in part by the National Science Foundation grants HRD-0734825, HRD-1242122, and DUE-0926721. The authors are thankful to all the participants of the 16th International Symposium on Scientific Computing, Computer Arithmetic, and Validated Numerics SCAN’2014 (Würzburg, German, September 21–26, 2014) for valuable discussions, and to the anonymous referees for valuable suggestions.
Author information
Authors and Affiliations
Corresponding author
Editor information
Editors and Affiliations
Rights and permissions
Open Access This chapter is licensed under the terms of the Creative Commons Attribution-NonCommercial 2.5 International License (http://creativecommons.org/licenses/by-nc/2.5/), which permits any noncommercial use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons license and indicate if changes were made.
The images or other third party material in this chapter are included in the chapter's Creative Commons license, unless indicated otherwise in a credit line to the material. If material is not included in the chapter's Creative Commons license and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder.
Copyright information
© 2016 Springer International Publishing Switzerland
About this paper
Cite this paper
Longpré, L., Kosheleva, O., Kreinovich, V. (2016). Towards the Possibility of Objective Interval Uncertainty. In: Nehmeier, M., Wolff von Gudenberg, J., Tucker, W. (eds) Scientific Computing, Computer Arithmetic, and Validated Numerics. SCAN 2015. Lecture Notes in Computer Science(), vol 9553. Springer, Cham. https://doi.org/10.1007/978-3-319-31769-4_5
Download citation
DOI: https://doi.org/10.1007/978-3-319-31769-4_5
Published:
Publisher Name: Springer, Cham
Print ISBN: 978-3-319-31768-7
Online ISBN: 978-3-319-31769-4
eBook Packages: Computer ScienceComputer Science (R0)