Algorithmic information theory is a field of theoretical computer science. It is concerned with how information and computation are related. Most information can be represented as a String (or a sequence of characters). Algorithmic information theory studies the complexity of information represented that way (In other words, how difficult it is to get that information, or how long it takes). Unlike regular information theory, it uses Kolmogorov complexity to describe complexity, and not the measure of complexity developed by Claude Shannon and Warren Weaver. Kolmogorov complexity was developed independently by Andrey Kolmogorov and Gregory Chaitin .