Author: Thomas Zeugmann
Source: Mathematical Methods of Specification and Synthesis of Software Systems '85, Proceedings of the International Spring School Wendisch-Rietz, GDR, April 22-26, 1985, (W. Bibel and K.P. Jantke, Eds.), Lecture Notes in Artificial Intelligence 215, pp. 240 - 245, Springer 1986.
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 spite of the negative result proved by ALTON we point out that even for function classes containing arbitrarily complex functions sometimes the effective synthesis of fastest programs (modulo a recursive factor) can be achieved.
©Copyright 1986, Springer