The general problem of finding minimal programs realizing given “program descriptions” is considered, where program descriptions may be of finite or infinite length and may specify arbitrary program properties. The problem of finding minimal programs consistent with finite or infinite input-output lists is a special case (for infinite input-output lists, this is a variant of E. M. Gold's function identification problem). Although most program minimization problems are not recursively solvable, they are found to be no more difficult than the problem of deciding whether any given program realizes any given description, or the problem of enumerating programs in order of nondecreasing length (whichever is harder). This result is formulated in terms of k-limiting recursive predicates and functionals, defined by repeated application of Gold's limit operator. A simple consequence is that the program minimization problem is limiting recursively solvable for finite input-output lists and 2-limiting recursively solvable for infinite input-output lists, with weak assumptions about the measure of program size. Gold regarded limiting function identification (more generally, “black box” identification) as a model of inductive thought. Intuitively, iterated limiting identification might be regarded as higher-order inductive inference performed collectively by an ever-growing community of lower order inductive inference machines.
[1]
Ray J. Solomonoff,et al.
A Formal Theory of Inductive Inference. Part II
,
1964,
Inf. Control..
[2]
Ray J. Solomonoff,et al.
A Formal Theory of Inductive Inference. Part I
,
1964,
Inf. Control..
[3]
Hilary Putnam,et al.
Trial and error predicates and the solution to a problem of Mostowski
,
1965,
Journal of Symbolic Logic.
[4]
Jerome A. Feldman,et al.
Some Decidability Results on Grammatical Inference and Complexity
,
1972,
Inf. Control..
[5]
David Pager.
On the Problem of Finding Minimal Programs for Tables
,
1969,
Inf. Control..
[6]
Journal of the Association for Computing Machinery
,
1961,
Nature.
[7]
Gregory J. Chaitin,et al.
On the difficulty of computations
,
1970,
IEEE Trans. Inf. Theory.
[8]
E. Mark Gold,et al.
Limiting recursion
,
1965,
Journal of Symbolic Logic.
[9]
Manuel Blum.
On the Size of Machines
,
1967,
Inf. Control..
[10]
David G. Willis,et al.
Computational Complexity and Probability Constructions
,
1970,
JACM.
[11]
A. Kolmogorov.
Three approaches to the quantitative definition of information
,
1968
.
[12]
Per Martin-Löf,et al.
The Definition of Random Sequences
,
1966,
Inf. Control..