Prefix-Like Complexities and Computability in the Limit
Computability in the limit represents the non-plus-ultra of constructive describability. It is well known that the limit computable functions on naturals are exactly those computable with the oracle for the halting problem. However, prefix (Kolmogorov) complexities defined with respect to these two models may differ. We introduce and compare several natural variations of prefix complexity definitions based on generalized Turing machines embodying the idea of limit computability, as well as complexities based on oracle machines, for both finite and infinite sequences.
KeywordsKolmogorov complexity limit computability generalized Turing machine non-halting computation
Unable to display preview. Download preview PDF.
- 6.Case, J., Jain, S., Sharma, A.: On Learning Limiting Programs. In: Proc. of COLT 1992, pp. 193–202. ACM Press, New York (1992)Google Scholar
- 8.Chernov, A., Schmidhuber, J.: Prefix-like Complexities of Finite and Infinite Sequences on Generalized Turing Machines. Technical Report IDSIA-11-05, Manno (Lugano), Switzerland (2005)Google Scholar
- 16.Levin, L.A.: Laws of Information (Nongrowth) and Aspects of the Foundation of Probability Theory. Problems of Information Transmission 10(3), 206–210 (1974)Google Scholar
- 19.Schmidhuber, J.: Algorithmic Theories of Everything. Technical Report IDSIA-20-00, quant-ph/0011122, IDSIA, Manno (Lugano), Switzerland (2000)Google Scholar
- 23.Uspensky, V.A., Vereshchagin, N.K., Shen, A.: Lecture Notes on Kolmogorov Complexity (unpublished), http://lpcs.math.msu.su/~ver/kolm-book