On the Information Carried by Programs About the Objects they Compute
In computability theory and computable analysis, finite programs can compute infinite objects. Such objects can then be represented by finite programs. Can one characterize the additional useful information contained in a program computing an object, as compared to having the object itself? Having a program immediately gives an upper bound on the Kolmogorov complexity of the object, by simply measuring the length of the program, and such an information cannot usually be derived from an infinite representation of the object. We prove that bounding the Kolmogorov complexity of the object is the only additional useful information. Hence we identify the exact relationship between Markov-computability and Type-2-computability. We then use this relationship to obtain several results characterizing the computational and topological structure of Markov-semidecidable sets. This article is an extended version of Hoyrup and Rojas (2015), including complete proofs and a new result (Theorem 9).
KeywordsMarkov-computable Representation Kolmogorov complexity Ershov topology
This work was partially supported by Inria program “Chercheur invité”. C.R. was partially supported by a FONDECYT grant No. 1150222, a Universidad Andres Bello grant No. DI-782-15/R and a BASAL grant No. PFB-03 CMM-Universidad de Chile.
- 7.Hertling, P.: Computable real functions: Type 1 computability versus Type 2 computability. In: CCA (1996)Google Scholar
- 8.Hoyrup, M., Rojas, C.: On the information carried by programs about the objects they compute. In: Mayr, E. W., Ollinger, N. (eds.) 32nd International Symposium on Theoretical Aspects of Computer Science, STACS 2015, March 4-7, 2015, Garching, Germany, volume 30 of LIPIcs, pp 447–459. Schloss Dagstuhl - Leibniz-Zentrum fuer Informatik (2015)Google Scholar