On the power of recursive optimizers

2Citations
Citations of this article
13Readers
Mendeley users who have this article in their library.

Abstract

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.

Cite

CITATION STYLE

APA

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

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free