Every Sequence is Decompressible from a Random One
| dc.creator | Doty, David | |
| dc.date | 2005-11-21 | |
| dc.date | 2006-08-11 | |
| dc.date.accessioned | 2026-07-07T08:17:54Z | |
| dc.date.available | 2026-07-07T08:17:54Z | |
| dc.description | Kucera and Gacs independently showed that every infinite sequence is Turing reducible to a Martin-Lof random sequence. This result is extended by showing that every infinite sequence S is Turing reducible to a Martin-Lof random sequence R such that the asymptotic number of bits of R needed to compute n bits of S, divided by n, is precisely the constructive dimension of S. It is shown that this is the optimal ratio of query bits to computed bits achievable with Turing reductions. As an application of this result, a new characterization of constructive dimension is given in terms of Turing reduction compression ratios. | |
| dc.description | revised conclusion to remove possibly incorrect statements about reversibility of decompression; restated as open question | |
| dc.identifier | https://arxiv.org/abs/cs/0511074 | |
| dc.identifier | http://arxiv.org/abs/cs/0511074 | |
| dc.identifier.uri | http://salesiana.dossiersoluciones.com/handle/123456789/134252 | |
| dc.subject | Information Theory | |
| dc.subject | Computational Complexity | |
| dc.subject | F.1.1; H.1.1 | |
| dc.title | Every Sequence is Decompressible from a Random One | |
| dc.type | text |