One — one degrees of Turing machines decision problems

  • Joanna Jędrzejowicz
Part of the Lecture Notes in Computer Science book series (LNCS, volume 45)


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. /1/.
    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/.Google Scholar
  2. /2/.
    R.Overbeek—The representation of many-one degrees by decision problems of Turing machines, Proc. London Math. Soc., Jan.1973, pp. 167–192.Google Scholar
  3. /3/.
    H.Rogers—Theory of recursive functions and effective computability, Mc Graw Hill Company 1967.Google Scholar
  4. /4/.
    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.Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1976

Authors and Affiliations

  • Joanna Jędrzejowicz
    • 1
  1. 1.Institute of MathematicsUniversity of GdańskPoland

Personalised recommendations