Abstract
Let M := [F;G], i.e. the smallest set including G which is closed under the functions from F, where F and G are finite. Any numbering v of M implies v-computability on M. The effective numberings of M with respect to F are defined in two equivalent ways, firstly as the class of numberings equivalent to the term numbering, and secondly as the minimal numbering (with respect to many-one reducibility) in the class of those numberings for which the functions from F become computable.
This is a preview of subscription content, log in via an institution to check access.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1977 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Weihrauch, K. (1977). A generalized computability thesis. In: Gruska, J. (eds) Mathematical Foundations of Computer Science 1977. MFCS 1977. Lecture Notes in Computer Science, vol 53. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-08353-7_181
Download citation
DOI: https://doi.org/10.1007/3-540-08353-7_181
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-08353-5
Online ISBN: 978-3-540-37285-1
eBook Packages: Springer Book Archive