A Concept of Independence with Applications in Various Fields of Mathematics
Name
MIT-LCS-TR-235.pdf
Size
1.33 MB
Format
Adobe PDF
Checksum (MD5)
a4411d3315ed91f772b9147e4c81d094
Author(s)
Levin, Leonid A.
Date Issued
May 1980
Series/Report no.
MIT-LCS-TR-235
Abstract
We use Kolmogorov'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.
Persistent DSpace Link