Problems of the effective synthesis of fastest programs (modulo a recursive factor) for recursive functions given by input-output examples or an arbitrary program are investigated. In contrast to the non-existence result proved by Alton (1974, 1976) we show various existence results. Thereby we deal in detail with the influence of the recursive factor in dependence of the concrete formalization of a fastest program. In particular, we shall show that, even for function classes containing arbitrarily complex functions, the effective synthesis of fastest programs (modulo a simple recursive operator) can be achieved sometimes. © 1988.
Zeugmann, T. (1988). On the power of recursive optimizers. Theoretical Computer Science, 62(3), 289–310. https://doi.org/10.1016/0304-3975(88)90071-0