Show simple item record

dc.contributor.authorLevin, Leonid A.en_US
dc.date.accessioned2023-03-29T15:03:54Z
dc.date.available2023-03-29T15:03:54Z
dc.date.issued1980-05
dc.identifier.urihttps://hdl.handle.net/1721.1/149516
dc.description.abstractWe 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.ispartofseriesMIT-LCS-TR-235
dc.titleA Concept of Independence with Applications in Various Fields of Mathematicsen_US


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record