Advertisement

The Incompressibility Method

  • Ming LiEmail author
  • Paul Vitányi
Chapter
Part of the Texts in Computer Science book series (TCS)

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 pigeonhole 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.

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

Copyright information

© Ming Li and Paul Vitányi 2019

Authors and Affiliations

  1. 1.University of WaterlooWaterlooCanada
  2. 2.Centrum voor Wiskunde en Informatica (CWI)AmsterdamThe Netherlands

Personalised recommendations