Abstract
By an operation we mean a function whose arguments and values are sets. Although a conventional computable function effectively produces one constructive object from another, a computable operation effectively produces one set of constructive objects from another; informally, effectiveness here means that the operation makes it possible to generate the resulting set provided a process of generation of the argument is given. Because of the above statement a computable operation transforms generable sets into generable sets. We can summarize these ideas in the following definition of a computable operation (see [Us 55] or [Rog 67, sect.9.7] where computable operations are called enumeration operators).
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
Author information
Authors and Affiliations
Rights and permissions
Copyright information
© 1993 Springer Science+Business Media Dordrecht
About this chapter
Cite this chapter
Uspensky, V., Semenov, A. (1993). The concept of a computable operation. In: Algorithms: Main Ideas and Applications. Mathematics and Its Applications, vol 251. Springer, Dordrecht. https://doi.org/10.1007/978-94-015-8232-2_16
Download citation
DOI: https://doi.org/10.1007/978-94-015-8232-2_16
Publisher Name: Springer, Dordrecht
Print ISBN: 978-90-481-4256-9
Online ISBN: 978-94-015-8232-2
eBook Packages: Springer Book Archive