Skip to main content

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

  • 157 Accesses

Abstract

The incompressibility of random objects yields a simple but powerful proof technique. The incompressibility method is a general purpose tool and should be compared with the pidgeon hole principle or the probabilistic method. Whereas the older methods generally show the existence of an object with the required properties, the incompressibility argument shows that almost all objects have the required property. This follows immediately from the fact that the argument is typically used on a Kolmogorov random object. Since such objects are effectively undistinguishable, the proof holds for all such objects. Each class of objects has an abundance of relatively Kolmogorov random objects. In fact, they have probability about 1.

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

Access this chapter

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

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). The Incompressibility Method. 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_6

Download citation

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

  • 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