Abstract
An index e in a numbering of partial-recursive functions is called minimal if every lesser index computes a different function from e. Since the 1960s, it has been known that, in any reasonable programming language, no effective procedure determines whether or not a given index is minimal. We investigate whether the task of determining minimal indices can be solved in an approximate sense. Our first question, regarding the set of minimal indices, is whether there exists an algorithm that can correctly label 1 out of k indices as either minimal or nonminimal. Our second question, regarding the function that computes minimal indices, is whether one can compute a short list of candidate indices that includes a minimal index for a given program. We give negative answers to both questions for the important case of numberings with linearly bounded translators.
- B. Bauwens, A Makhlin, N. Vereshchagin, and M. Zimand. 2013. Short lists with short programs in short time. In Proceedings of the 28th IEEE Conference on Computational Complexity (CCC’13). Stanford, CA. 98--108. DOI:http://dx.doi.org/10.1109/CCC.2013.19Google Scholar
- Bruno Bauwens and Marius Zimand. 2014. Linear list-approximation for short programs (or the power of a few random bits). In Proceedings of the 29th IEEE Conference on Computational Complexity (CCC’14). Vancouver, BC, Canada IEEE Computer Society, 241--247. DOI:http://dx.doi.org/10.1109/CCC.2014.32 Google Scholar
Digital Library
- Richard Beigel, Harry Buhrman, Peter Fejer, Lance Fortnow, Piotr Grabowski, Luc Longpré, Andrej Muchnik, Frank Stephan, and Leen Torenvliet. 2006. Enumerations of the Kolmogorov function. The Journal of Symbolic Logic 71, 2, 501--528. DOI: http://dx.doi.org/10.2178/jsl/1146620156Google Scholar
Cross Ref
- Manuel Blum. 1967. On the size of machines. Information and Control 11, 257--265.Google Scholar
Cross Ref
- Sam Epstein and Leonid A. Levin. 2012. Sets have simple members. Retrieved July 16, 2015 from http://arxiv.org/abs/1107.1458v7.Google Scholar
- Richard M. Friedberg. 1958. Three theorems on recursive enumeration. I. Decomposition. II. Maximal set. III. Enumeration without duplication. The Journal of Symbolic Logic 23, 309--316.Google Scholar
Cross Ref
- William Gasarch. 2003. Gems in the field of bounded queries. In Computability and Models, S. Barry Cooper and Sergey Goncharov (Eds.). Springer, New York, 161--195.Google Scholar
- Sanjay Jain, Frank Stephan, and Jason Teutsch. 2011. Index sets and universal numberings. Journal of Computer and System Sciences 77, 4, 760--773. Google Scholar
Digital Library
- Sanjay Jain and Jason Teutsch. Enumerations including laconic enumerators. Retrieved July 16, 2015 from http://math.uni-heidelberg.de/logic/conferences/ccr2015/Slides%20CCR/ccr2015_teutsch.pdf.Google Scholar
- Martin Kummer. 1990. An easy priority-free proof of a theorem of Friedberg. Theoretical Computer Science 74, 2, 249--251. DOI:http://dx.doi.org/10.1016/0304-3975(90)90141-4 Google Scholar
Digital Library
- Ming Li and Paul Vitányi. 2008. An introduction to Kolmogorov complexity and its applications (3rd ed.). Springer, New York. xxiv+790 pages. DOI:http://dx.doi.org/10.1007/978-0-387-49820-1 Google Scholar
Digital Library
- Albert R. Meyer. 1972. Program size in restricted programming languages. Information and Control 21, 382--394.Google Scholar
Cross Ref
- Piergiorgio Odifreddi. 1989. Classical recursion theory. Studies in Logic and the Foundations of Mathematics, Vol. 125. North-Holland Publishing Co., Amsterdam. xviii+668 pages.Google Scholar
- Marcus Schaefer. 1998. A guided tour of minimal indices and shortest descriptions. Archive for Mathematical Logic 37, 8, 521--548.Google Scholar
Cross Ref
- Alexander Shen. 2012. Game arguments in computability theory and algorithmic information theory. In How the World Computes, S. Barry Cooper, Anuj Dawar, and Benedikt Löwe (Eds.). Lecture Notes in Computer Science, Vol. 7318. Springer, Berlin, 655--666. DOI:http://dx.doi.org/10.1007/978-3-642-30870-3_66 Google Scholar
Digital Library
- Alexander Shen, Vladimir Uspensky, and Nikolay Vereshchagin. Textbook of Kolmogorov complexity. Manuscript. http://www.lirmm.fr/∼ashen/kolmbook-eng.pdf.Google Scholar
- Robert I. Soare. 1987. Recursively enumerable sets and degrees. Springer-Verlag, Berlin. xviii+437 pages. A study of computable functions and computably generated sets. Google Scholar
Digital Library
- Frank Stephan. 2008. Private communication.Google Scholar
- Frank Stephan and Jason Teutsch. 2008. Immunity and hyperimmunity for sets of minimal indices. Notre Dame Journal of Formal Logic 49, 2, 107--125.Google Scholar
Cross Ref
- Frank Stephan and Jason Teutsch. 2012. An incomplete set of shortest descriptions. The Journal of Symbolic Logic 77, 1, 291--307.Google Scholar
Cross Ref
- Jason Teutsch. 2007. On the Turing degrees of minimal index sets. Annals of Pure and Applied Logic 148, 63--80.Google Scholar
Cross Ref
- Jason Teutsch. 2014. Short lists for shortest descriptions in short time. Computational Complexity 23, 4, 565--583. http://dx.doi.org/10.1007/s00037-014-0090-3. Google Scholar
Digital Library
- Jason Teutsch and Marius Zimand. 2014. On approximate decidability of minimal programs. CoRR-arxiv abs/1409.0496. http://arxiv.org/abs/1409.0496.Google Scholar
- A. M. Turing. 1936. On computable numbers, with an application to the entscheidungsproblem. Proceedings of the London Mathematical Society S2-42, 1, 230--265. DOI:http://dx.doi.org/10.1112/plms/s2-42.1.230Google Scholar
- Nikolay Vereshchagin. 2009. Algorithmic minimal sufficient statistic revisited. In Mathematical Theory and Computational Practice, Klaus Ambos-Spies, Benedikt Löwe, and Wolfgang Merkle (Eds.). Lecture Notes in Computer Science, Vol. 5635. Springer, Berlin, 478--487. DOI:http://dx.doi.org/10.1007/978-3-642-03073-4_49 See also the updated manuscript, “Algorthmic minimal sufficient statistic: a new definition.’’ Google Scholar
Digital Library
- Nikolay Vereshchagin. 2014. Short lists with short programs for functions. CoRR-arxiv abs/1409.5906. http://arxiv.org/abs/1409.5906.Google Scholar
- Marius Zimand. 2014. Short lists with short programs in short time—a short proof. In Proceedings of the 10th CiE, Budapest, Hungary, Language, Life, Limits, Arnold Beckmann, Erzsébet Csuhaj-Varjú, and Klaus Meer (Eds.). Lecture Notes in Computer Science, Vol. 8493. Springer International Publishing, 403--408. DOI:http://dx.doi.org/10.1007/978-3-319-08019-2_42Google Scholar
Cross Ref
- A. K. Zvonkin and L. A. Levin. 1970. The complexity of finite objects and the development of the concepts of information and randomness by means of the theory of algorithms. Russian Mathematical Surveys 25, 6, 83--124. http://dx.doi.org/10.1070/RM1970v025n06ABEH001269.Google Scholar
Cross Ref
Index Terms
On Approximate Decidability of Minimal Programs
Recommendations
Enumerations including laconic enumerators
We show that it is possible, for every machine universal for Kolmogorov complexity, to enumerate the lexicographically least description of a length n string in O(n) attempts. In contrast to this positive result for strings, we find that, in any ...
Fiedler Companion Linearizations and the Recovery of Minimal Indices
A standard way of dealing with a matrix polynomial $P(\lambda)$ is to convert it into an equivalent matrix pencil—a process known as linearization. For any regular matrix polynomial, a new family of linearizations generalizing the classical first and ...
Index sets and universal numberings
This paper studies the Turing degrees of various properties defined for universal numberings, that is, for numberings which list all partial-recursive functions. In particular properties relating to the domain of the corresponding functions are ...






Comments