Share Email Print
cover

Proceedings Paper

Kolmogorov complexity, statistical regularization of inverse problems, and Birkhoff's formalization of beauty
Author(s): Vladik Kreinovich; Luc Longpre; Misha Koshelev
Format Member Price Non-Member Price
PDF $14.40 $18.00
cover GOOD NEWS! Your organization subscribes to the SPIE Digital Library. You may be able to download this paper for free. Check Access

Paper Abstract

Most practical applications of statistical methods are based on the implicit assumption that if an event has a very small probability, then it cannot occur. For example, the probability that a kettle placed on a cold stove would start boiling by itself is not 0, it is positive, but it is so small, that physicists conclude that such an event is simply impossible. This assumption is difficult to formalize in traditional probability theory, because this theory only describes measures on sets and does not allow us to divide functions into 'random' and non-random ones. This distinction was made possible by the idea of algorithmic randomness, introduce by Kolmogorov and his student Martin- Loef in the 1960s. We show that this idea can also be used for inverse problems. In particular, we prove that for every probability measure, the corresponding set of random functions is compact, and, therefore, the corresponding restricted inverse problem is well-defined. The resulting techniques turns out to be interestingly related with the qualitative esthetic measure introduced by G. Birkhoff as order/complexity.

Paper Details

Date Published: 22 September 1998
PDF: 12 pages
Proc. SPIE 3459, Bayesian Inference for Inverse Problems, (22 September 1998); doi: 10.1117/12.323795
Show Author Affiliations
Vladik Kreinovich, Univ. of Texas at El Paso (United States)
Luc Longpre, Univ. of Texas at El Paso (United States)
Misha Koshelev, Univ. of Texas at El Paso (United States)


Published in SPIE Proceedings Vol. 3459:
Bayesian Inference for Inverse Problems
Ali Mohammad-Djafari, Editor(s)

© SPIE. Terms of Use
Back to Top