A Machine-Independent Theory of the Complexity of Recursive Functions
Journal of the ACM (JACM)
Classes of computable functions defined by bounds on computation: Preliminary Report
STOC '69 Proceedings of the first annual ACM symposium on Theory of computing
An Example of Information and Computation Resource Trade-Off
Journal of the ACM (JACM)
Information-Theoretic Limitations of Formal Systems
Journal of the ACM (JACM)
To a mathematical definition of 'life'
ACM SIGACT News
The extent and density of sequences within the minimal-program complexity hierarchies
Journal of Computer and System Sciences
Sequential predictions based on algorithmic complexity
Journal of Computer and System Sciences
A note on blum static complexity measures
WTCS'12 Proceedings of the 2012 international conference on Theoretical Computer Science: computation, physics and beyond
Randomness behaviour in blum universal static complexity spaces
DCFS'12 Proceedings of the 14th international conference on Descriptional Complexity of Formal Systems
| Hi-index | 0.00 |
Brief consideration is given to some properties of three measures of complexity based on the length of minimal descriptive programs. Although the measures explicitly deal with finite sequences, the complexity of an infinite sequence can be regarded as a function mapping each positive integer n to the complexity of the initial segment of length n. Some properties of a complexity hierarchy of infinite sequences with respect to one of the measures is considered.