Abstract
In this paper we study the Kolmogorov complexity for non-effective computations, that is, either halting or non-halting computations on Turing machines. This complexity function is defined as the length of the shortest input that produce a desired output via a possibly non-halting 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 prefix-free 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
Keywords infinite computations  Kolmogorov complexity  monotone machines  non-effective computations  program-size complexity  Turing machines
Categories (categorize this paper)
DOI 10.1007/s10849-005-2255-6
Options
Edit this record
Mark as duplicate
Export citation
Find it on Scholar
Request removal from index
Revision history

Download options

PhilArchive copy


Upload a copy of this paper     Check publisher's policy     Papers currently archived: 70,008
Through your library

References found in this work BETA

On Degrees of Unsolvability.J. R. Shoenfield - 1964 - Journal of Symbolic Logic 29 (4):203-204.

Add more references

Citations of this work BETA

Add more citations

Similar books and articles

Analytics

Added to PP index
2009-01-28

Total views
65 ( #175,990 of 2,505,158 )

Recent downloads (6 months)
1 ( #416,587 of 2,505,158 )

How can I increase my downloads?

Downloads

My notes