Abstract
We prove that neat and natural fragments of Gödel’s 
and Plotkin’s 
capture complexity classes defined by imposing resource bounds on Turing machines.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Avigad, J., Feferman, S.: Gödel’s functional interpretation. In: Buss, S. (ed.) Handbook of Proof Theory. Elsevier (1998)
Barra, G., Kristiansen, L., Voda, P.: Nondeterminism without Turing machines. In: Cooper, S.B., Löwe, B., Sorbi, A. (eds.) CiE 2007. LNCS, vol. 4497. Springer, Heidelberg (2007), http://www.mat.unisi.it/~sorbi/Proceedings.pdf
Goerdt, A., Seidl, H.: Characterizing complexity classes by higher type primitive recursive definitions, part ii. In: Dassow, J., Kelemen, J. (eds.) Aspects and prospects of theoretical computer science, Smolenice. LNCS, vol. 464, pp. 148–158. Springer, Heidelberg (1990)
Goerdt, A.: Characterizing complexity classes by higher type primitive recursive definitions. Theoretical Computer Science 100, 45–66 (1992)
Jones, N.: The expressive power of higher-order types or, life without CONS. Journal of Functional Programming 11, 55–94 (2001)
Jones, N.: LOGSPACE and PTIME characterized by programming languages. Theoretical Computer Science 228, 151–174 (1999)
Kristiansen, L.: Neat function algebraic characterizations of LOGSPACE and LINSPACE. Computational Complexity 14, 72–88 (2005)
Kristiansen, L.: Complexity-theoretic hierarchies. In: Beckmann, A., Berger, U., Löwe, B., Tucker, J.V. (eds.) CiE 2006. LNCS, vol. 3988, pp. 279–288. Springer, Heidelberg (2006)
Kristiansen, L.: Complexity-theoretic hierarchies induced by fragments of Gödel’s
. In: Theory of Computing Systems. Springer, Heidelberg (2007)Kristiansen, L., Barra, G.: The small Grzegorczyk classes and the typed λ-calculus. In: Cooper, S.B., Löwe, B., Torenvliet, L. (eds.) CiE 2005. LNCS, vol. 3526, pp. 252–262. Springer, Heidelberg (2005)
Kristiansen, L., Voda, P.: Complexity classes and fragments of C. Information Processing Letters 88, 213–218 (2003)
Kristiansen, L., Voda, P.: The surprising power of restricted programs and Gödel’s functionals. In: Baaz, M., Makowsky, J.A. (eds.) CSL 2003. LNCS, vol. 2803, pp. 345–358. Springer, Heidelberg (2003)
Kristiansen, L., Voda, P.: Programming languages capturing complexity classes. Nordic Journal of Computing 12, 1–27 (2005); Special issue for NWPT 2004
Kristiansen, L., Voda, P.: The trade-off theorem and fragments of Gödel’s
. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol. 3959, pp. 654–674. Springer, Heidelberg (2006)Odifreddi, P.: Classical recursion theory II. Studies in Logic and the Foundations of Mathematics, vol. 143. North-Holland Publishing Co., Amsterdam (1999)
Streicher, T.: Domain-theoretic foundations of functional programming. World Scientific Publishing Co. Pte. Ltd, Singapore (2006)
. In: Theory of Computing Systems. Springer, Heidelberg (2007)
. In: Cai, J.-Y., Cooper, S.B., Li, A. (eds.) TAMC 2006. LNCS, vol. 3959, pp. 654–674. Springer, Heidelberg (2006)Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 2008 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Kristiansen, L. (2008). Recursion in Higher Types and Resource Bounded Turing Machines. In: Beckmann, A., Dimitracopoulos, C., Löwe, B. (eds) Logic and Theory of Algorithms. CiE 2008. Lecture Notes in Computer Science, vol 5028. Springer, Berlin, Heidelberg. https://doi.org/10.1007/978-3-540-69407-6_37
Download citation
DOI: https://doi.org/10.1007/978-3-540-69407-6_37
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-69405-2
Online ISBN: 978-3-540-69407-6
eBook Packages: Computer ScienceComputer Science (R0)