An introduction to Kolmogorov complexity and its applications (2nd ed.)
An introduction to Kolmogorov complexity and its applications (2nd ed.)
Information and Randomness: An Algorithmic Perspective
Information and Randomness: An Algorithmic Perspective
Descriptive complexity of computable sequences
Theoretical Computer Science
Comparison Between the Complexity of a Function and the Complexity of Its Graph
MFCS '98 Proceedings of the 23rd International Symposium on Mathematical Foundations of Computer Science
Deterministic Rational Transducers and Random Sequences
FoSSaCS '98 Proceedings of the First International Conference on Foundations of Software Science and Computation Structure
Descriptive complexity of computable sequences
Theoretical Computer Science
| Hi-index | 5.23 |
This paper investigates in terms of Kolmogorov complexity the differences between the information necessary to compute a recursive function and the information contained in its graph. Our first result is that the complexity of the initial parts of the graph of a recursive function, although bounded, has almost never a limit. The second result is that the complexity of these initial parts approximate the complexity of the function itself in most cases (and in the average) but not always.