Advertisement

Negative results about the length problem

  • Martin Kummer
Chapter
Part of the Lecture Notes in Computer Science book series (LNCS, volume 270)

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

2. References

  1. [1]
    M. Kummer Rekursiv aufzählbare Erweiterungen von R1 um endliche Funktionen Diplomarbeit, Universität Karlsruhe, February 1986Google Scholar
  2. [2]
    W. Menzel, V. Sperschneider Recursively enumerable extensions of R1 by finite functions Lecture notes in computer science 171, p. 62–77, 1984Google Scholar
  3. [3]
    J. Mohrherr A remark on the length problem Manuscricpt, 1986Google Scholar
  4. [4]
    H. Rogers Theory of recursive functions and effective computability New York, 1967Google Scholar
  5. [5]
    R. I. Soare Tree arguments in recursion theory and the 0'''-priority method Proc. of symposia in pure mathematics, Vol. 42, p. 53–106, 1985Google Scholar
  6. [6]
    J. R. Shoenfield Degrees of unsolvability Amsterdam, 1971Google Scholar
  7. [7]
    V. Sperschneider The length-problem Lecture notes in computer science 171, p. 88–102, 1984Google Scholar

Copyright information

© Springer-Verlag Berlin Heidelberg 1987

Authors and Affiliations

  • Martin Kummer
    • 1
  1. 1.Institut für Informatik IUniversität KarlsruheKarlsruheF.R.G.

Personalised recommendations