On the Synthesis of Fastest Programs in Inductive Inference

Author: Thomas Zeugmann

Source: EIK 19, No. 12, 1983, 625 - 642.

Abstract. Problems of inductive inference of recursive functions from input-output examples are investigated concerning the computational complexity of synthesized programs. In particular, the question is discussed under which conditions it is possible to synthesize a fastest program (modulo recursive operator) of the function to be identified.

©Copyright 1983 Akademie Verlag.