A guided tour of minimal indices and shortest descriptions

Abstract. The set of minimal indices of a Gödel numbering $\varphi$ is defined as ${\rm MIN}_{\varphi} = \{e: (\forall i < e)[\varphi_i \neq \varphi_e]\}$. It has been known since 1972 that ${\rm MIN}_{\varphi} \equiv_{\mathrm{T}} \emptyset^{\prime \prime }$, but beyond this ${\rm MIN}_{\varphi}$ has remained mostly uninvestigated. This paper collects the scarce results on ${\rm MIN}_{\varphi}$ from the literature and adds some new observations including that ${\rm MIN}_{\varphi}$ is autoreducible, but neither regressive nor (1,2)-computable. We also study several variants of ${\rm MIN}_{\varphi}$ that have been defined in the literature like size-minimal indices, shortest descriptions, and minimal indices of decision tables. Some challenging open problems are left for the adventurous reader.

[1]  Paul D. Young.  A Note on "Axioms" for Computational Complexity and Computation of Finite Functions , 1971, Inf. Control..

[2]  Ming Li,et al.  An Introduction to Kolmogorov Complexity and Its Applications , 2019, Texts in Computer Science.

[3]  Martin Kummer.  An Easy Priority-Free Proof of a Theorem of Friedberg , 1990, Theor. Comput. Sci..

[4]  Robert I. Soare,et al.  Recursively Enumerable Sets Modulo Iterated Jumps and Extensions of Arslanov's Completeness Criterion , 1989, J. Symb. Log..

[5]  Martin Kummer.  On the Complexity of Random Strings (Extended Abstract) , 1996, STACS.

[6]  Amitava Bagchi.  Economy of Descriptions and Minimal Indices. , 1972 .

[7]  James C. Owings,et al.  Effective Choice Functions and Index Sets , 1986, J. Comput. Syst. Sci..

[8]  G. B. Marandzjan.  On the Sets of Minimal Indices of Partial Recursive Functions , 1979, MFCS.

[9]  Carl G. Jockusch,et al.  Weakly Semirecursive Sets , 1990, J. Symb. Log..

[10]  C. Jockusch.  Semirecursive sets and positive reducibility , 1968 .

[11]  Albert R. Meyer.  Program Size in Restricted Programming Languages , 1972, Inf. Control..

[12]  John Case,et al.  Not-So-Nearly-Minimal-Size Program Inference , 1995, GOSLER Final Report.

[13]  J. Cleave.  Some Properties of Recursively Inseparable Sets , 1970 .

[14]  R. Soare.  Recursively enumerable sets and degrees , 1987 .

[15]  Jefim Kinber.  On btt-Degrees of Sets of Minimal Numbers in Gödel Numberings , 1977, Math. Log. Q..

[16]  Frank Stephan,et al.  Recursion Theoretic Properties of Frequency Computation and Bounded Queries , 1995, Inf. Comput..

[17]  David Pager.  Further Results on the Problem of Finding Minimal Length Programs for Decision Tables , 1974, JACM.

[18]  Manuel Blum.  On the Size of Machines , 1967, Inf. Control..

[19]  P. Odifreddi.  Classical recursion theory , 1989 .

[20]  David Pager.  On the Problem of Finding Minimal Programs for Tables , 1969, Inf. Control..