Randomness Conservation Inequalities; Information and Independence in Mathematical Theories

The article develops further Kolmogorov's Algorithmic Complexity Theory.

The definition of Randomness is modified to satisfy strong invariance properties (conservation inequalities).

This allows definitions of concepts such as Mutual Information in individual infinite sequences.

Applications to several areas, like Probability Theory, Theory of Algorithms, Intuitionistic Logic are considered.

These theories are simplified substantially with the postulate that the objects they consider are independent of (have small mutual information with) any sequence specified by a mathematical property.