Algorithmic Complexity

Part of the Texts in Computer Science book series (TCS)


The most natural approach to defining the quantity of information is clearly to define it in relation to the individual object (be it Homer's Odyssey or a particular type of dodo) rather than in relation to a set of objects from which the individual object may be selected. To do so, one could define the quantity of information in an object in terms of the number of bits required to losslesly describe it. A description of an object is evidently useful in this sense only if we can reconstruct the full object from this description.


Turing Machine Binary String Recursive Function Kolmogorov Complexity Uniform Measure 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Copyright information

© The Author(s) 2008

Authors and Affiliations

  1. 1.Cheriton School of Computer ScienceUniversity of WaterlooWaterlooCanada
  2. 2.Centrum voor Wiskunde en InformaticaAmsterdamThe Netherlands

Personalised recommendations