Wolfgang Merkle, Nenad Mihailovic  Home/Search
Context
Related
| math.uniheidelberg.d...construction.ps Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: math.uniheidelberg.de...wmpapers (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We give a direct and rather simple construction of Martin-Löf random and rec-random sets with certain additional properties. First, reviewing the result of Gacs and Kucera, given any set X we construct a Martin-Löf random set R from which X can be decoded effectively. (Update)
Similar documents (at the sentence level):
31.1%: Effective Randomness - Merkle (2004) (Correct)
6.0%: On the Autoreducibility of Random Sequences - Ebert, Merkle, Vollmer (2001) (Correct)
5.0%: Some Results on Effective Randomness - Merkle, Mihailovic, Slaman (2003) (Correct)
Active bibliography (related documents): More All
0.5: Effective Fractal Dimensions - Lutz (Correct)
0.4: Some Computability-Theoretical Aspects of Reals and Randomness - Downey (2001) (Correct)
0.4: Complexity and Randomness - Terwijn (2003) (Correct)
Similar documents based on text: More All
0.7: Computable Enumeration And The Problem Of Repetition - Wehner (1995) (Correct)
0.7: Computable Isomorphisms, Degree Spectra of Relations, and.. - Khoussainov, Shore (Correct)
0.6: Simple Sets and Strong Reducibilities - Ho, Stephan (Correct)
BibTeX entry: (Update)
@misc{ merkle-construction,
author = "Wolfgang Merkle and Nenad Mihailovic",
title = "On the Construction of Effective Random Sets",
url = "citeseer.ist.psu.edu/539179.html" }
Citations (may not include all citations):660 An Introduction to Kolmogorov Complexity and Its Application.. - Li, Vit - 1997
167 Structural Complexity (context) - Balc, az et al. - 1995
161 Recursively Enumerable Sets and Degrees (context) - Soare - 1987
142 Almost everywhere high nonuniform complexity - Lutz - 1992
137 Classical Recursion Theory (context) - Odifreddi - 1989
71 The quantitative structure of exponential time - Lutz - 1997
65 Mathematical Analysis (context) - Apostol - 1978
47 Information and Randomness (context) - Calude - 1994
22 Soviet Math (context) - Trakhtenbrot, autoreducibility - 1970
19 Resource-bounded measure and randomness (context) - Ambos-Spies, Mayordomo - 1997
19 Information and Control (context) - Martin-L, de nition et al. - 1966
15 Randomness in computability theory (context) - Ambos-Spies, Ku - 2000
15 alligkeit und Wahrscheinlichkeit (context) - Schnorr - 1971
14 Contributions to the Study of Resource-Bounded Measure - Mayordomo - 1994
10 A uni ed approach to the de nition of random sequences (context) - Schnorr - 1971
9 the autoreducibility of random sequences - Ebert, Vollmer - 2000
8 Theoretical Computer Science (context) - Calude, of et al. - 2002
7 Applications of Recursive Operators to Randomness and Comple.. (context) - Ebert - 1998
6 the use of diagonally nonrecursive functions (context) - Ku, On - 1989
5 Every sequence is reducible to a random one (context) - acs - 1986
3 classes and complete extensions of PA (context) - Ku, Measure - 1985
3 Universiteit van Amsterdam (context) - Terwijn, Measure - 1998
1 Autoreducibility of random sets: a sharp bound on the densit.. (context) - Ebert, Merkle - 2002
Documents on the same site (http://math.uni-heidelberg.de/logic/merkle/wmpapers.html): More
Almost Complete Sets - Ambos-Spies, Merkle, Reimann, Terwijn (2000) (Correct)
The Global Power of Additional Queries to p-Random Oracles - Merkle (Correct)
Separations by Random Oracles and "Almost" Classes for.. - Merkle, Wang (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC