Kolmogorov entropy in the context of computability theory
Theoretical Computer Science
Category, Measure, Inductive Inference: A Triality Theorem and Its Applications
LATIN '02 Proceedings of the 5th Latin American Symposium on Theoretical Informatics
Hard Instances of Hard Problems
STACS '00 Proceedings of the 17th Annual Symposium on Theoretical Aspects of Computer Science
Lower bounds for reducibility to the Kolmogorov random strings
CiE'10 Proceedings of the Programs, proofs, process and 6th international conference on Computability in Europe
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 | 0.00 |