Skip to main content

On the relationship between the complexity, the degree, and the extension of a computable set

  • 281 Accesses

Part of the Lecture Notes in Mathematics book series (LNM,volume 1432)

Abstract

We consider the equivalence relation A =c B (“A and B have the same time complexity”) ⇔ (for all time constructible f : ADTIME(f)BDTIME(f)). In this paper we give a survey of the known relationships between this equivalence relation and degree theoretic and extensional properties of sets. Furthermore we illustrate the proof techniques that have been used for this analysis, with emphasis on those arguments that are of interest from the point of view of recursion theory. Finally we will discuss in the last section some open problems and directions for further research on this topic.

Keywords

  • Time Complexity
  • Polynomial Time
  • Turing Machine
  • Complexity Type
  • Extensional Property

These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.

Written under partial support by NSF-Grant CCR 8903398. Part of this research was carried out during a visit of the first author at the University. The first author would like to thank the Department of Computer Science at the University of Chicago for its hospitality.

Written under partial support by Presidential Young Investigator Award DMS-8451748 and NSF-Grant DMS-8601856.

This is a preview of subscription content, access via your institution.

Buying options

Chapter
USD   29.95
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD   34.99
Price excludes VAT (Canada)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD   46.00
Price excludes VAT (Canada)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Learn about institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

  1. A.V. Aho, J.E. Hopcroft, J.D. Ullman, The Design and Analysis of Computer Algorithms, Addison-Wesley (Reading, 1974).

    Google Scholar 

  2. M. Blum, A machine-independent theory of the complexity of recursive functions, J. ACM, 14(1967), 322–336.

    CrossRef  MathSciNet  MATH  Google Scholar 

  3. S.A. Cook, R.A. Reckhow, Time-bounded random access machines, J. Comp. Syst. Sc., 7(1973), 354–375.

    CrossRef  MathSciNet  MATH  Google Scholar 

  4. A.K. Dewdney, Linear time transformations between combinatorial problems, Internat. J. Computer Math., 11(1982), 91–110.

    CrossRef  MathSciNet  MATH  Google Scholar 

  5. J.G. Geske, D.T. Huynh, A.L. Selman, A hierarchy theorem for almost everywhere complex sets with applications to polynomial complexity degrees, Proc. of the 4th Annual Symposium on Theoretical Aspects of Computer Science, Lecture Notes in Computer Science, vol. 247 (Springer, 1987), 125–135.

    Google Scholar 

  6. J. Hartmanis, J.E. Hopcroft, An overview of the theory of computational complexity, J. ACM, 18(1971), 444–475.

    CrossRef  MathSciNet  MATH  Google Scholar 

  7. R. Ladner, On the structure of polynomial-time reducibility, J. ACM, 22(1975), 155–171.

    CrossRef  MathSciNet  MATH  Google Scholar 

  8. L. Landweber, R. Lipton, and E. Robertson, On the structure of sets in N P and other classes, TCS, 15(1981), 181–200.

    CrossRef  MathSciNet  MATH  Google Scholar 

  9. M. Lerman, Degrees of Unsolvability, Springer (1983).

    Google Scholar 

  10. L.A. Levin, On storage capacity for algorithms, Soviet Math. Dokl., 14(1973), 1464–1466.

    MATH  Google Scholar 

  11. N. Lynch, Helping: several formalizations, J. of Symbolic Logic, 40(1975), 555–566.

    CrossRef  MathSciNet  MATH  Google Scholar 

  12. W. Maass, T. A. Slaman, The complexity types of computable sets (extended abstract), Proc. of the Structure in Complexity Theory Conference, 1989.

    Google Scholar 

  13. W. Maass, T.A. Slaman, Extensional properties of sets of time bounded complexity (extended abstract), Proc. of the 7th Int. Conf. on Fundamentals of Computation Theory, J. Csirik, J. Demetrovics, F. Gésceg, eds., Lecture Notes in Computer Science vol. 380, Springer Verlag (Berlin 1989), 318–326.

    CrossRef  Google Scholar 

  14. W. Maass, T. A. Slaman, The complexity types of computable sets, in preparation.

    Google Scholar 

  15. M. Machtey, P. Young, An Introduction to the General Theory of Algorithms, North-Holland (Amsterdam, 1978).

    Google Scholar 

  16. S. Mahaney, Sparse complete sets for N P: solution of a conjecture of Berman and Hartmanis, J. Comp. Syst. Sc., 25(1982), 130–143.

    CrossRef  MathSciNet  MATH  Google Scholar 

  17. A.R. Meyer, P.C. Fischer, Computational speed-up by effective operators, J. of Symbolic Logic, 37(1972), 55–68.

    CrossRef  MathSciNet  MATH  Google Scholar 

  18. A.R. Meyer, K. Winklmann, The fundamental theorem of complexity theory, Math. Centre Tracts, 108(1979), 97–112.

    MathSciNet  MATH  Google Scholar 

  19. W.J. Paul, Komplexitaetstheorie, Teubner (Stuttgart, 1978).

    Google Scholar 

  20. C.P. Schnorr, G. Stumpf, A characterization of complexity sequences, Zeitschr. f. math. Logik u. Grundlagen d. Math., 21(1975), 47–56.

    CrossRef  MathSciNet  MATH  Google Scholar 

  21. J. Shinoda, T.A. Slaman, On the theory of the PTIME degrees of the recursive set, Proc. of Structure in Complexity Theory Conference, 1988, 252–257.

    Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and Permissions

Copyright information

© 1990 Springer-Verlag

About this paper

Cite this paper

Maass, W., Slaman, T.A. (1990). On the relationship between the complexity, the degree, and the extension of a computable set. In: Ambos-Spies, K., Müller, G.H., Sacks, G.E. (eds) Recursion Theory Week. Lecture Notes in Mathematics, vol 1432. Springer, Berlin, Heidelberg. https://doi.org/10.1007/BFb0086124

Download citation

  • DOI: https://doi.org/10.1007/BFb0086124

  • Published:

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-52772-5

  • Online ISBN: 978-3-540-47142-4

  • eBook Packages: Springer Book Archive