Author:
Merkle Wolfgang,Mihailović Nenad
Abstract
Abstract.We present a comparatively simple way to construct Martin-Löf random and rec-random sets with certain additional properties, which works by diagonalizing against appropriate martingales. Reviewing the result of Gács and Kučera, for any given set X we construct a Martin-Löf random set from which X can be decoded effectively.By a variant of the basic construction we obtain a rec-random set that is weak truth-table autoreducible and we observe that there are Martin-Löf random sets that are computably enumerable self-reducible. The two latter results complement the known facts that no rec-random set is truth-table autoreducible and that no Martin-Löf random set is Turing-autoreducible [8, 24].
Publisher
Cambridge University Press (CUP)
Reference24 articles.
1. On autoreducibility;Trakhtenbrot;Soviet Mathematics Doklady,1970
2. Mayordomo E. , Contributions to the study of resource-hounded measure, Ph.D. thesis , Universitat Politècnica de Catalunya, Barcelona, Spain, 1994.
3. The definition of random sequences
4. An Introduction to Kolmogorov Complexity and Its Applications
Cited by
14 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献
1. Relativized depth;Theoretical Computer Science;2023-03
2. The Kučera–Gács theorem revisited by Levin;Theoretical Computer Science;2023-02
3. Compression of Data Streams Down to Their Information Content;IEEE Transactions on Information Theory;2019-07
4. Optimal redundancy in computations from random oracles;Journal of Computer and System Sciences;2018-03
5. Dimension 1 sequences are close to randoms;Theoretical Computer Science;2018-01