Skip to main content

Algorithmic Probability

  • Chapter
  • 155 Accesses

Part of the book series: Texts and Monographs in Computer Science ((MCS))

Abstract

P.S. Laplace (1749 – 1827) has pointed out the following reason why intuitively a regular outcome of a random event is unlikely.

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

Buying options

Chapter
USD   29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   74.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Author information

Authors and Affiliations

Authors

Rights and permissions

Reprints and permissions

Copyright information

© 1993 Springer Science+Business Media New York

About this chapter

Cite this chapter

Li, M., Vitányi, P. (1993). Algorithmic Probability. In: An Introduction to Kolmogorov Complexity and Its Applications. Texts and Monographs in Computer Science. Springer, New York, NY. https://doi.org/10.1007/978-1-4757-3860-5_4

Download citation

  • DOI: https://doi.org/10.1007/978-1-4757-3860-5_4

  • Publisher Name: Springer, New York, NY

  • Print ISBN: 978-1-4757-3862-9

  • Online ISBN: 978-1-4757-3860-5

  • eBook Packages: Springer Book Archive

Publish with us

Policies and ethics