A CONCEPT OF INDEPENDENCE WITH APPLICATIONS IN VARIOUS FIELDS OF MATHEMATICS
Leonid A. Levin · DSpace@MIT (Massachusetts Institute of Technology) · 1980
We use Kohnogorov's algorithmic approach to information theory to define a concept of independence of sequences, or equivalently, the boundedness of their mutual information. This concept is applied to probability theory, intuitionistic logic, and the theory of algorithms. For each case, we study the advantage of accepting the postulate that the objects studied by the theory are independent of any sequence deterinined by a nathematical property.