Abstract
Higher type primitive recursive definitions (also known as Gödel's system T) defining first-order functions (i.e. functions of type ind→...→ind→ind, ind for individuals, higher types occur in between) can be classified into an infinite syntactic hierarchy: A definition is in the n'th stage of this hierarchy, a so called rank-n-definition, iff n is an upper bound on the levels of the types occurring in it.
We interpret these definitions over finite structures and show for n≥1: Rank-(2n+2)-definitions characterize (in the sense of [Gu83], say) the complexity class DTIME(expn(poly)) whereas rank-(2n+3)-definitions characterize DSPACE(expn(poly)) (here exp0(x) = x, expn+1(x)=2exp n x). This extends the results that rank-1-definitions characterize LOGSPACE [Gu83], rank-2-definitions characterize PTIME, rank-3-definitions characterize PSPACE, rank-4-definitions characterize EXPTIME [Go89a].
Preview
Unable to display preview. Download preview PDF.
Literature
Barendregt, H., The lambda calculus. North Holland 1984.
Goerdt, A., Characterizing complexity classes by higher type primitive recursive definitions, LICS (1989), 364–374.
Goerdt, A., Characterizing complexity classes by finitely typed λ-terms, Workshop Computer Science Logic 1988, LNCS, to appear.
Gurevich, Y., Algebras of feasible functions, 24th FOCS (1983), 210–214.
Gurevich, Y., Toward logic taylored for computational complexity, computation and proof theory, LNM 1104 (1984), 175–216.
Immerman, N., Expressibility as a complexity measure: results and directions, 2nd Conf. Structure in Complexity Theory (1987), 194–202.
Kfoury, A., Tiuryn, J.,Urzyczyn, P., The hierarchy of finitely typed functional programs, LICS (1987), 225–235.
Leivant, D., Characterization of complexity classes in higher order logic, 2nd conf. Structure in Complexity Theory (1987), 203–218.
Plotkin, G., LCF considered as a programming language, TCS 5 (1977), 223–257.
Schwichtenberg, H., Elimination of higher type levels in definitions of primitive recursive functions by means of transfinite recursion, Logic Colloquium 1973, North Holland.
Sazonov, V., Polynomial computability and recursivity in finite domains, EIK 16 (1980), 319–323.
Terlouw, J., On the definition trees of ordinal recursive functionals: reduction of recursion orders by means of type level raising, J. Symbolic Logic 47 (1982), 395–403.
Tiuryn, J., Higher order arrays and stacks in programming: An application of complexity theory to logics of programs, 12th MFCS (1986), LNCS 233, 177–198.
Tiuryn, J.,Urzyczyn, P., Some connections between logic of programs and complexity theory. 24th FOCS (1983), 180–184.
Author information
Authors and Affiliations
Editor information
Rights and permissions
Copyright information
© 1990 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Goerdt, A., Seidl, H. (1990). Characterizing complexity classes by higher type. In: Dassow, J., Kelemen, J. (eds) Aspects and Prospects of Theoretical Computer Science. IMYCS 1990. Lecture Notes in Computer Science, vol 464. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-53414-8_37
Download citation
DOI: https://doi.org/10.1007/3-540-53414-8_37
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-53414-3
Online ISBN: 978-3-540-46869-1
eBook Packages: Springer Book Archive