Algorithmically Independent Sequences

Show simple item record Calude, C.S en Zimand, M en 2009-04-16T23:17:10Z en 2009-04-16T23:17:10Z en 2008-01 en
dc.identifier.citation CDMTCS Research Reports CDMTCS-317 (2008) en
dc.identifier.issn 1178-3540 en
dc.identifier.uri en
dc.description.abstract Two objects are independent if they do not a ect each other. Independence is wellunderstood in classical information theory, but less in algorithmic information theory. Working in the framework of algorithmic information theory, the paper proposes two types of independence for arbitrary in nite binary sequences and studies their properties. Our two proposed notions of independence have some of the intuitive properties that one naturally expects. For example, for every sequence x, the set of sequences that are independent with x has measure one. For both notions of independence we investigate to what extent pairs of independent sequences, can be e ectively constructed via Turing reductions (from one or more input sequences). In this respect, we prove several impossibility results. For example, it is shown that there is no e ective way of producing from an arbitrary sequence with positive constructive Hausdor dimension two sequences that are independent (even in the weaker type of independence) and have super-logarithmic complexity. Finally, a few conjectures and open questions are discussed. en
dc.publisher Department of Computer Science, The University of Auckland, New Zealand en
dc.relation.ispartofseries CDMTCS Research Report Series en
dc.rights.uri en
dc.source.uri en
dc.title Algorithmically Independent Sequences en
dc.type Technical Report en
dc.subject.marsden Fields of Research::280000 Information, Computing and Communication Sciences en
dc.rights.holder The author(s) en
dc.rights.accessrights en

Files in this item

Find Full text

This item appears in the following Collection(s)

Show simple item record


Search ResearchSpace