Abstract
This paper discusses refinements of the natural ordering of them-degrees (1-degrees) of strong recursive reducibility classes. Such refinements are obtained by posing complexity conditions on the reduction function. The discussion uses the axiomatic complexity theory and is hence very general. As the main result it is proved that if the complexity measure is required to be linearly bounded (and space-like), then a natural class of refinements forms a lattice with respect to a natural ordering upon them.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
Bibliography
Manuel Blum,A machine-independent theory of the complexity of the recursive functions,Journal of the ACM Vol 14, No. 2 (1967), pp. 322–336.
W. Brainerd &L. Landweber,Theory of Computation, John Wiley & Sons, New York 1974.
Manuel Lerman,The degrees of unsolvability: Some recent results, In:F. R. Drake &S. S. Wainer (eds):Recursion Theory: its Generalisations and Applications, Cambridge University Press, Cambridge 1980.
Michael Machtey &Paul Young,An Introduction to the General Theory of Algorithms, North-Holland, New York 1978.
Odifreddi Piergiorgio,Strong reducibilities,Bulletin of the American Mathematical Society 4 (1981), pp. 37–86.
Hartley Rogers Jr.,Theory of Recursive Functions and Effective Computability, McGraw-Hill, New York (1967).
Author information
Authors and Affiliations
Rights and permissions
About this article
Cite this article
Talja, J. On the complexity-relativized strong reducibilites. Stud Logica 42, 259–267 (1983). https://doi.org/10.1007/BF01063845
Received:
Issue Date:
DOI: https://doi.org/10.1007/BF01063845