Kolmogorov Complexity for Possibly Infinite Computations
 Verónica Becher,
 Santiago Figueira
 … show all 2 hide
Rent the article at a discount
Rent now* Final gross prices may vary according to local VAT.
Get AccessAbstract
In this paper we study the Kolmogorov complexity for noneffective computations, that is, either halting or nonhalting computations on Turing machines. This complexity function is defined as the length of the shortest input that produce a desired output via a possibly nonhalting computation. Clearly this function gives a lower bound of the classical Kolmogorov complexity. In particular, if the machine is allowed to overwrite its output, this complexity coincides with the classical Kolmogorov complexity for halting computations relative to the first jump of the halting problem. However, on machines that cannot erase their output –called monotone machines–, we prove that our complexity for non effective computations and the classical Kolmogorov complexity separate as much as we want. We also consider the prefixfree complexity for possibly infinite computations. We study several properties of the graph of these complexity functions and specially their oscillations with respect to the complexities for effective computations.
 Title
 Kolmogorov Complexity for Possibly Infinite Computations
 Journal

Journal of Logic, Language and Information
Volume 14, Issue 2 , pp 133148
 Cover Date
 200503
 DOI
 10.1007/s1084900522556
 Print ISSN
 09258531
 Online ISSN
 15729583
 Publisher
 Kluwer Academic Publishers
 Additional Links
 Topics
 Keywords

 infinite computations
 Kolmogorov complexity
 monotone machines
 noneffective computations
 programsize complexity
 Turing machines
 Authors

 Verónica Becher ^{(1)}
 Santiago Figueira ^{(1)}
 Author Affiliations

 1. Departamento de Computación, Facultad de Ciencias Exactas y Naturales, Universidad de Buenos Aires, Argentina