Comparison between the complexity of a function and the complexity of its graph
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.
Unable to display preview. Download preview PDF.
- C. Calude. Information and Randomness, an Algorithmic Perspective. Springer-Verlag, 1994.Google Scholar
- B. Durand, Alexander Shen, and Nikolai Vereshchagin. Descriptive complexity of computable sequences. Draft, 1998.Google Scholar
- M. Li and P. Vitányi. An Introduction to Kolmogorov Complexity and its Applications. Springer-Verlag, 2 edition, 1997.Google Scholar
- S. Porrot, M. Dauchet, B. Durand, and N. Vereshchagin. Deterministic rational transducers and random sequences. In FOSSACS'98, volume 1378 of Lecture Notes in Computer Science, pages 258–272. Springer-Verlag, march 1998.Google Scholar