Under Physics-Motivated Constraints, Generally-Non-Algorithmic Computational Problems become Algorithmically Solvable

  • Vladik KreinovichEmail author
Part of the Studies in Computational Intelligence book series (SCI, volume 539)


It is well known that many computational problems are, in general, not algorithmically solvable: e.g., it is not possible to algorithmically decide whether two computable real numbers are equal, and it is not possible to compute the roots of a computable function. We propose to constraint such operations to certain “sets of typical elements” or “sets of random elements”.

In our previous papers, we proposed (and analyzed) physics-motivated definitions for these notions. In short, a set T is a set of typical elements if for every definable sequences of sets A n with A n  ⊇ A n + 1 and \(\bigcap\limits_{n} A_n=\emptyset\), there exists an N for which A N  ∩ T = ∅; the definition of a set of random elements with respect to a probability measure P is similar, with the condition \(\bigcap\limits_{n} A_n=\emptyset\) replaced by a more general condition \(\lim\limits_n P(A_n)=0\).

In this paper, we show that if we restrict computations to such typical or random elements, then problems which are non-computable in the general case – like comparing real numbers or finding the roots of a computable function – become computable.


constraints computable problems random elements typical elements 


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Finkelstein, A.M., Kreinovich, V.: Impossibility of hardly possible events: physical consequences. In: Abstracts of the 8th International Congress on Logic, Methodology, and Philosophy of Science, 1987, Moscow, vol. 5(2), pp. 23–25 (1987)Google Scholar
  2. 2.
    Kreinovich, V.: Toward formalizing non-monotonic reasoning in physics: the use of Kolmogorov complexity. Revista Iberoamericana de Inteligencia Artificial 41, 4–20 (2009)Google Scholar
  3. 3.
    Kreinovich, V., Finkelstein, A.M.: Towards applying computational complexity to foundations of physics. Notes of Mathematical Seminars of St. Petersburg Department of Steklov Institute of Mathematics 316, 63–110 (2004); reprinted in Journal of Mathematical Sciences 134(5), 2358–2382 (2006)Google Scholar
  4. 4.
    Kreinovich, V., Kunin, I.A.: Kolmogorov complexity and chaotic phenomena. International Journal of Engineering Science 41(3), 483–493 (2003)CrossRefzbMATHMathSciNetGoogle Scholar
  5. 5.
    Kreinovich, V., Kunin, I.A.: Kolmogorov complexity: how a paradigm motivated by foundations of physics can be applied in robust control. In: Fradkov, A.L., Churilov, A.N. (eds.) Proceedings of the International Conference “Physics and Control” PhysCon 2003, Saint-Petersburg, Russia, August 20-22, pp. 88–93 (2003)Google Scholar
  6. 6.
    Kreinovich, V., Kunin, I.A.: Application of Kolmogorov complexity to advanced problems in mechanics. In: Proceedings of the Advanced Problems in Mechanics Conference APM 2004, St. Petersburg, Russia, June 24-July 1, pp. 241–245 (2004)Google Scholar
  7. 7.
    Kreinovich, V., Longpré, L., Koshelev, M.: Kolmogorov complexity, statistical regularization of inverse problems, and Birkhoff’s formalization of beauty. In: Mohamad-Djafari, A. (ed.) Bayesian Inference for Inverse Problems, Proceedings of the SPIE/International Society for Optical Engineering, San Diego, California, vol. 3459, pp. 159–170 (1998)Google Scholar
  8. 8.
    Li, M., Vitanyi, P.: An Introduction to Kolmogorov Complexity and Its Applications. Springer (2008)Google Scholar
  9. 9.
    Pour-El, M.B., Richards, J.I.: Computability in Analysis and Physics. Springer, Berlin (1989)CrossRefzbMATHGoogle Scholar
  10. 10.
    Weihrauch, K.: Computable Analysis. Springer, Berlin (2000)CrossRefzbMATHGoogle Scholar

Copyright information

© Springer International Publishing Switzerland 2014

Authors and Affiliations

  1. 1.Department of Computer ScienceUniversity of Texas at El PasoEl PasoUSA

Personalised recommendations