Skip to main content
SpringerLink
Log in

Algorithmic Information Theory and Foundations of Probability

  • Conference paper
Reachability Problems (RP 2009)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 5797))

Included in the following conference series:

Abstract

The question how and why mathematical probability theory can be applied to the “real world” has been debated for centuries. We try to survey the role of algorithmic information theory (Kolmogorov complexity) in this debate.

This is a preview of subscription content, log in via an institution to check access.

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. Bienvenu, L., Shen, A.: Algorithmic information theory and martingales, preprint, arXiv:0906.2614

    Google Scholar 

  2. Borel, E.: Le hazard, Alcan, Paris (1914), Russian translation: Gosizdat, Moscow – Petrograd (1923)

    Google Scholar 

  3. Borel, E.: Probabilité et certitude, Presse Univ. de France, Paris (1950), English translation: Probability and certainty, Walker publishers (1963), Russian translation: Fizmatgiz, Moscow (1961)

    Google Scholar 

  4. Goldreich, O.: Foundations of Cryptography. Basic Tools, vol. 1. Cambridge University Press, Cambridge (2007)

    MATH  Google Scholar 

  5. Polya, G.: Mathematics and Plausible Reasoning, vol. 1,2. Princeton University Press, Princeton (1990) (reprint)

    MATH  Google Scholar 

  6. Renyi, A.: Letters on probability. Wayne State University Press (1972)

    Google Scholar 

  7. Uspensky, V., Semenov, A., Shen, A.: Can an individual sequence of zeros and ones be random? Russian Mathematical Surveys 45(1), 121–189 (1990)

    Article  MathSciNet  MATH  Google Scholar 

  8. Shen, A.: On the logical basis of application of probability theory. In: Proc. Workshop on semiotic aspects of the formalization of intellectual activity, Telavi (Georgia, then USSR), VINITI, Moscow, pp. 144–146 (1983)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. LIF Marseille, CNRS & Univ. Aix–Marseille, On leave from IITP, RAS, Moscow, Supported in part by NAFIT ANR-08-EMER-008-01 grant, Russia

    Alexander Shen

Authors
  1. Alexander Shen
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Ecole Polytechnique, Laboratoire d’ Informatique (LIX), 91128, Palaiseau Cedex, France

    Olivier Bournez

  2. Department of Computer Science, Ashton Building, University of Liverpool, L69 3BX, Liverpool, England

    Igor Potapov

Rights and permissions

Reprints and permissions

Copyright information

© 2009 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Shen, A. (2009). Algorithmic Information Theory and Foundations of Probability. In: Bournez, O., Potapov, I. (eds) Reachability Problems. RP 2009. Lecture Notes in Computer Science, vol 5797. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-642-04420-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-3-642-04420-5_4

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-642-04419-9

  • Online ISBN: 978-3-642-04420-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation