Algorithms: main ideas and applications
Algorithms: main ideas and applications
Recursion theoretic properties of frequency computation and bounded queries
Information and Computation
On the Complexity of Random Strings (Extended Abstract)
STACS '96 Proceedings of the 13th Annual Symposium on Theoretical Aspects of Computer Science
On semimeasures predicting Martin-Löf random sequences
Theoretical Computer Science
Limits on the computational power of random strings
ICALP'11 Proceedings of the 38th international colloquim conference on Automata, languages and programming - Volume Part I
Randomness, computation and mathematics
CiE'12 Proceedings of the 8th Turing Centenary conference on Computability in Europe: how the world computes
Limits on the computational power of random strings
Information and Computation
| Hi-index | 5.23 |
We consider the overgraph of the Kolmogorov entropy function and study whether it is a complete enumerable set with respect to different types of reductions. It turns out that (for any type of entropy) the overgraph of the conditional entropy function is m-.