Recursively enumerable sets and degrees
Recursively enumerable sets and degrees
Category and measure in complexity classes
SIAM Journal on Computing
An introduction to Kolmogorov complexity and its applications
An introduction to Kolmogorov complexity and its applications
Kolmogorov complexity and Hausdorff dimension
Information and Computation
Array nonrecursive degrees and genericity
Computability, enumerability, unsolvability
Kolmogorov Complexity and Instance Complexity of Recursively Enumerable Sets
SIAM Journal on Computing
A Kolmogorov complexity characterization of constructive Hausdorff dimension
Information Processing Letters
The dimensions of individual strings and sequences
Information and Computation
Visualization 2001 Conference (Acm
Visualization 2001 Conference (Acm
Effective Strong Dimension in Algorithmic Information and Computational Complexity
SIAM Journal on Computing
Computability and Randomness
Two sources are better than one for increasing the Kolmogorov complexity of infinite sequences
CSR'08 Proceedings of the 3rd international conference on Computer science: theory and applications
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Lowness for bounded randomness
Theoretical Computer Science
| Hi-index | 0.89 |
A relatively longstanding question in algorithmic randomness is Jan Reimann's question whether there is a Turing cone of broken dimension. That is, is there a real A such that {B:B=