A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
An Example of Information and Computation Resource Trade-Off
Journal of the ACM (JACM)
On minimal-program complexity measures
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
A Theory of Program Size Formally Identical to Information Theory
Journal of the ACM (JACM)
The Kolmogorov Complexity of Real Numbers
FCT '99 Proceedings of the 12th International Symposium on Fundamentals of Computation Theory
The Kolmogorov complexity of infinite words
Theoretical Computer Science
On Oscillation-free ε-random Sequences
Electronic Notes in Theoretical Computer Science (ENTCS)
Constructive dimension and Hausdorff dimension: the case of exact dimension
FCT'11 Proceedings of the 18th international conference on Fundamentals of computation theory
| Hi-index | 0.00 |
In this paper we examine the minimal-program complexity (i.e., the length of a shortest program for computing the initial segments) of recursively enumerable and @D"2 sequences. We determine bounds on the upper and lower extent of these sequences within the complexity hierarchy. Many of these bounds are the best which can be effectively specified. Also the density of these sequences within the hierarchies is investigated. Of particular interest is the construction of nonrecursive sequences which are, in a complexity sense, extremely simple and easy to compute.