Iterated Limiting Recursion and the Program Minimization Problem

@inproceedings{Schubert1974IteratedLR,
  title={Iterated Limiting Recursion and the Program Minimization Problem},
  author={Lenhart K. Schubert},
  booktitle={JACM},
  year={1974}
}
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… 

Limiting Recursion and the Arithmetic Hierarchy

A complete characterization of the Kleene hierarchy in terms of the iterated limit opération which fully answers an open problem indicated by Schubert and is interesting in its own right.

Representative Samples of Programmable Functions

Can everything be computed? - On the Solvability Complexity Index and Towers of Algorithms

It is proved that no algorithm can provide error control on the computational spectral problem or solutions to infinite -dimensional linear systems, and the SCI provides a natural framework for understanding barriers in computations.

Induction, Pure and Simple

Computation as an unbounded process

A Calculus of Realizers for EM1 Arithmetic (Extended Abstract)

A realizability interpretation of a system for quantifier free arithmetic which is equivalent to the fragment of classical arithmetic without nested quantifiers, which is called EM 1 -arithmetic, is proposed, and any two quantifier-free formulas provably equivalent in classical arithmetic have the same realizer.

A Calculus of Realizers for EM 1 Arithmetic

We propose a realizability interpretation of a system for quantifier free arithmetic which is equivalent to the fragment of classical arithmetic without nested quantifiers, which we call

An Inductive Inference Bibliography

The following pages contain a bibliography of current work in inductive inference, the algorithmic synthesis of programs from examples, to aid researchers interested theoretical aspects of automatic program synthesis.

On the Inference of Optimal Descriptions

A theorem about automatic programming

This paper proposes to focus on systems that "do more" than such systems in the sense that they require less complete information about the programs they are to generate.

References

SHOWING 1-10 OF 17 REFERENCES

Limiting recursion

  • E. Gold
  • Mathematics
    Journal of Symbolic Logic
  • 1965
A class of problems is called decidable if there is an algorithm which will give the answer to any problem of the class after a finite length of time. The purpose of this paper is to discuss the

On the Problem of Finding Minimal Programs for Tables

  • D. Pager
  • Mathematics, Computer Science
    Inf. Control.
  • 1969

The Definition of Random Sequences

On the difficulty of computations

  • G. Chaitin
  • Computer Science
    IEEE Trans. Inf. Theory
  • 1970
The study of the running time of programs for computing infinite sets of natural numbers leads to an arithmetic of computers, which is a distributive lattice.

On the Size of Machines

  • M. Blum
  • Computer Science
    Inf. Control.
  • 1967

Computational Complexity and Probability Constructions

Using any universal Tur ing machine as a basis, it is possible to cons t ruc t an infinite number of increas ingly accurate computable probabil i ty measures which are independen t of any p robab i l i ty assumpt ions.