concerns itself with the relationship between computation and information of computably generated objects (as opposed to stochastically generated), such as strings or any other data structure
in other words, it is shown within algorithmic information theory that computational incompressibility “mimics” (except for a constant that only depends on the chosen universal programming language) the relations or inequalities found in information theory
according to Gregory Chaitin, it is “the result of putting Shannon’s information theory and Turing’s computability theory into a cocktail shaker and shaking vigorously”