A Concept of Independence with Applications in Various Fields of Mathematics
dc.contributor.author | Levin, Leonid A. | en_US |
dc.date.accessioned | 2023-03-29T15:03:54Z | |
dc.date.available | 2023-03-29T15:03:54Z | |
dc.date.issued | 1980-05 | |
dc.identifier.uri | https://hdl.handle.net/1721.1/149516 | |
dc.description.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. | en_US |
dc.relation.ispartofseries | MIT-LCS-TR-235 | |
dc.title | A Concept of Independence with Applications in Various Fields of Mathematics | en_US |