Searching for shortest and least programs
The Kolmogorov complexity of a string x is defined as the length of a shortest program p of x for some appropriate universal machine U, that is, U(p)=x and p is a shortest string with this property. Neither the plain nor the prefix-free version of Kolmogorov complexity are recursive but for both ver...
Saved in:
| Main Authors: | , , , |
|---|---|
| Format: | Article (Journal) |
| Language: | English |
| Published: |
2020
|
| In: |
Theoretical computer science
Year: 2019, Volume: 807, Pages: 114-127 |
| ISSN: | 1879-2294 |
| DOI: | 10.1016/j.tcs.2019.10.011 |
| Online Access: | Resolving-System, lizenzpflichtig, Volltext: https://doi.org/10.1016/j.tcs.2019.10.011 Verlag, lizenzpflichtig, Volltext: http://www.sciencedirect.com/science/article/pii/S0304397519306401 
|
| Author Notes: | Cristian S. Calude, Sanjay Jain, Wolfgang Merkle, Frank Stephan |
| Summary: | The Kolmogorov complexity of a string x is defined as the length of a shortest program p of x for some appropriate universal machine U, that is, U(p)=x and p is a shortest string with this property. Neither the plain nor the prefix-free version of Kolmogorov complexity are recursive but for both versions it is well-known that there are recursive exact Solovay functions, that is, recursive upper bounds for Kolmogorov complexity that are infinitely often tight. Let a coding function for a machine M be a function f such that f(x) is always a program of x for M. From the existence of exact Solovay functions it follows easily that for every universal machine there is a recursive coding function that maps infinitely many strings to a shortest program. Extending a recent line of research, in what follows it is investigated in which situations there is a coding function for some universal machine that maps infinitely many strings to the length-lexicographically least program. The main results which hold in the plain as well as in the prefix-free setting are the following. For every universal machine there is a recursive coding function that maps infinitely many strings to their least programs. There is a partial recursive coding function (defined in the natural way) for some universal machine that for every set maps infinitely many prefixes of the set to their least programs. Exactly for every set that is Bennett shallow (not deep), there is a recursive coding function for some universal machine that maps all prefixes of the set to their least programs. Differences between the plain and the prefix-free frameworks are obtained by considering effective sequences I1,I2,… of mutually disjoint finite sets and asking for a recursive coding function for some universal machine that maps at least one string in each set In to its least code. Such coding functions do not exist in the prefix-free setting but exist in the plain setting in case the sets In are not too small. |
|---|---|
| Item Description: | Available online 15 October 2019 Gesehen am 07.04.2020 |
| Physical Description: | Online Resource |
| ISSN: | 1879-2294 |
| DOI: | 10.1016/j.tcs.2019.10.011 |