Preview
Unable to display preview. Download preview PDF.
References
J.C. Shepherdson—Machine configuration and world problems of given degree of unsolvability, Z. math. Logik und Grund. Math. Bd. 11, 1965 /pp.149–175/.
R.Overbeek—The representation of many-one degrees by decision problems of Turing machines, Proc. London Math. Soc., Jan.1973, pp. 167–192.
H.Rogers—Theory of recursive functions and effective computability, Mc Graw Hill Company 1967.
C.E. Hughes, R. Overbeek, W.E. Singletary — The many-one equivalence of some general combinatorial decision problems Bull. Amer. Math. Soc., 77, 1971, pp. 467–472.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1976 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Jędrzejowicz, J. (1976). One — one degrees of Turing machines decision problems. In: Mazurkiewicz, A. (eds) Mathematical Foundations of Computer Science 1976. MFCS 1976. Lecture Notes in Computer Science, vol 45. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-07854-1_203
Download citation
DOI: https://doi.org/10.1007/3-540-07854-1_203
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-07854-8
Online ISBN: 978-3-540-38169-3
eBook Packages: Springer Book Archive