Skip to main content
SpringerLink
Log in

Speed-Up Theorems in Type-2 Computations Using Oracle Turing Machines

  • Published:
Theory of Computing Systems Aims and scope Submit manuscript

Abstract

A classic result known as the speed-up theorem in machine-independent complexity theory shows that there exist some computable functions that do not have best programs for them (Blum in J. ACM 14(2):322–336, 1967 and J. ACM 18(2):290–305, 1971). In this paper we lift this result into type-2 computations. Although the speed-up phenomenon is essentially inherited from type-1 computations, we observe that a direct application of the original proof to our type-2 speed-up theorem is problematic because the oracle queries can interfere with the speed of the programs and hence the cancellation strategy used in the original proof is no longer correct at type-2. We also argue that a type-2 analog of the operator speed-up theorem (Meyer and Fischer in J. Symb. Log. 37:55–68, 1972) does not hold, which suggests that this curious speed-up phenomenon disappears in higher-typed computations beyond type-2. The result of this paper adds one more piece of evidence to support the general type-2 complexity theory under the framework proposed in Li (Proceedings of the Third International Conference on Theoretical Computer Science, pp. 471–484, 2004 and Proceedings of Computability in Europe: Logical Approach to Computational Barriers, pp. 182–192, 2006) and Li and Royer (On type-2 complexity classes: Preliminary report, pp. 123–138, 2001) as a reasonable setup.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Similar content being viewed by others

References

  1. Abramsky, S., Gabbay, D.M., Maibaumeditors, T.S.E. (eds.): Handbook of Logic in Computer Science. Oxford University Press, Oxford (1992). Background: Mathematical Structures

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Blum, M.: On effective procedures for speeding up algorithms. J. ACM 18(2), 290–305 (1971)

    Article  MATH  MathSciNet  Google Scholar 

  4. Calude, C.: Theories of Computational Complexity. Annals of Discrete Mathematics, vol. 35. North-Holland/Elsevier Science Publisher, Amsterdam (1988)

    Book  MATH  Google Scholar 

  5. Cook, S.A.: Computability and complexity of higher type functions. In: Logic from Computer Science, pp. 51–72. Springer, Berlin (1991)

    Google Scholar 

  6. Cutland, N.: Computability: An Introduction to Recursive Function Theory. Cambridge University Press, New York (1980)

    MATH  Google Scholar 

  7. Davis, M. (ed.): The Undecidable. Raven Press, New York (1965)

    Google Scholar 

  8. Gandy, R.O., Hyland, J.M.E.: Computable and recursively countable functions of higher type. Log. Colloq. 76, 405–438 (1977)

    Google Scholar 

  9. Gödel, K.: Über die länge der beweise. Ergebnisse eines Math. Kolloq. 7, 23–24 (1936). Translation in Davis M. (ed.): The Undecidable, pp. 82–83. Raven Press, New York (1965). “On the length of proofs”

    Google Scholar 

  10. Hartmanis, J., Stearns, R.E.: On the computational complexity of algorithms. In: Transitions of the American Mathematics Society, pp. 285–306, May (1965)

  11. Kapron, B.M., Cook, S.A.: A new characterization of type 2 feasibility. SIAM J. Comput. 25, 117–132 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  12. Kleene, S.C.: Recursive functionals and quantifies of finite types I. Trans. Am. Math. Soc. 91, 1–52 (1959)

    Article  MATH  MathSciNet  Google Scholar 

  13. Kleene, S.C.: Turing-machine computable functionals of finite types II. Proc. Lond. Math. Soc. 12, 245–258 (1962)

    Article  MATH  MathSciNet  Google Scholar 

  14. Kleene, S.C.: Recursive functionals and quantifies of finite types II. Trans. Am. Math. Soc. 108, 106–142 (1963)

    Article  MATH  MathSciNet  Google Scholar 

  15. Li, C.-C.: Asymptotic behaviors of type-2 algorithms and induced baire topologies. In: Proceedings of the Third International Conference on Theoretical Computer Science, pp. 471–484. Toulouse, France, August (2004)

  16. Li, C.-C.: Clocking type-2 computation in the unit cost model. In: Proceedings of Computability in Europe: Logical Approach to Computational Barriers, pp. 182–192. Swansea, UK (2006). Report# CSR 7-2006

  17. Li, C.-C., Royer, J.S.: On type-2 complexity classes: Preliminary report, pp. 123–138, May (2001)

  18. Meyer, A.R., Fischer, P.C.: Computational speed-up by effective operators. J. Symb. Log. 37, 55–68 (1972)

    Article  MATH  MathSciNet  Google Scholar 

  19. Nerode, A.: General topology and partial recursive functionals. In: Talks Cornell Summ. Inst. Symb. Log., Cornell, pp. 247–251 (1957)

  20. Normann, D.: Recursive on the Countable Functionals. Lecture Notes in Mathematics, vol. 811. Springer, New York (1980)

    Google Scholar 

  21. Odifreddi, P.: Classical Recursion Theory. Studies in Logic and the Foundations of Mathematics, vol. 125. Elsevier Science/North-Holland, Amsterdam (1989)

    MATH  Google Scholar 

  22. Rogers, H. Jr.: Theory of Recursive Functions and Effective Computability. McGraw-Hill, New York (1967). First paperback edition published by MIT Press (1987)

    MATH  Google Scholar 

  23. Rogers, H. Jr.: Theory of Recursive Functions and Effective Computability, 3rd edn. MIT, Cambridge (1992). Original edition published by McGraw-Hill in 1967. First paperback edition published by MIT Press in 1987

    Google Scholar 

  24. Royer, J.S.: Semantics vs. syntax vs. computations: Machine models of type-2 polynomial-time bounded functionals. J. Comput. Syst. Sci. 54, 424–436 (1997)

    Article  MATH  MathSciNet  Google Scholar 

  25. Seiferas, J.I.: Machine-independent complexity theory. In: van Leeuwen, J. (ed.) Handbook of Theoretical Computer Science, vol. A, pp. 163–186. North-Holland/Elsevier Science, Amsterdam (1990). MIT press for paperback edition

    Google Scholar 

  26. Seth, A.: Complexity theory of higher type functionals. Ph.D. dissertation, University of Bombay (1994)

  27. Shoenfield, J.R.: The mathematical works of S.C. Kleene. Bull. Symb. Log. 1(1), 9–43 (1995)

    MATH  MathSciNet  Google Scholar 

  28. Uspenskii, V.A.: On countable operations (Russian). Dokl. Akad. Nauk SSSR 103, 773–776 (1955)

    MathSciNet  Google Scholar 

  29. Van Emde Boas, P.: Ten years of speed-up. In: Proceedings of the Fourth Symposium Mathematical Foundations of Computer Science. Lecture Notes in Computer Science, pp. 13–29. Springer, Berlin (1975)

    Google Scholar 

  30. Wagner, K., Wechsung, G.: Computational Complexity. Mathematics and Its Applications. Reidel, Dordrecht (1985)

    Google Scholar 

Download references

Author information

Authors and Affiliations

  1. School of Information Technology, Illinois State University, Normal, IL, 61790-5150, USA

    Chung-Chih Li

Authors
  1. Chung-Chih Li
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Chung-Chih Li.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Li, CC. Speed-Up Theorems in Type-2 Computations Using Oracle Turing Machines. Theory Comput Syst 45, 880–896 (2009). https://doi.org/10.1007/s00224-009-9182-x

Download citation

  • Received:

  • Accepted:

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s00224-009-9182-x

Keywords

Search

Navigation