Abstract
A resource-free characterization of some complexity classes is given by means of the predicative recursion and constructive diagonal- ization schemes, and of restrictions to substitution. Among other classes, we predicatively harmonize in the same hierarchy PTIMEF, the class ε of the elementary functions, and classes DTIMESPACEF(n p,n q).
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
S.J. Bellantoni, Predicative recursion and the polytime hierarchy, in P.Clote and J.Remmel (eds), Feasible Mathematics II (Birkauser, 1994), 320–343.
S. Bellantoni and S. Cook, A new recursion-theoretic characterization of the polytime functions, Computational Complexity 2(1992)97–110.
S. Caporaso, Safe Turing machines, Grzegorczyc classes and polytime, Intern. J. Found. Comp. Sc., 73(1996)241–252.
S. Caporaso, N. Galesi, M. Zito, A predicative and decidable characterization of the polytime classes of languages, to appear in Theoretical Comp. Sc.
S. Caporaso, M. Zito, N. Galesi, E. Covino Syntactic characterization in Lisp of the polynomial complexity classes and hierarchies, in G. Bongiovanni, D.P. Bovet, G. Di Battista (eds), Algorithms and Complexity, LNCS 1203(1997)61–73.
S. Caporaso, G. Pani, E. Covino, Predicative recursion, constructive diagonalization and the elementary functions, Workshop on Implicit Computational Complexity (ICC99), affiliated with LICS99, Trento, 1999.
P. Clote, A time-space hierarchy between polynomial time and polynomial space, Math. Sys. The. 25(1992)77–92.
A. Cobham, The intrinsic computational difficulty of functions, in Y. Bar-Hillel (ed), Proceedings of the International Conference on Logic, Methodology, and Philosophy of Science, pages 24–30, North-Holland, Amsterdam, 1962.
F.C. Hennie and R.E. Stearns, Two-tape simulation of multi-tapes TM’s, Journal of ACM 134(1966)533–546.
D. Leivant, A foundational delineation of computational feasibility, Proc. of the 6th Annual IEEE symposium on Logic in Computer Science, (IEEE Computer Society Press, 1991), 2–18.
D. Leivant, Stratified functional programs and computational complexity, in Conference Records of the 20th Annual ACM Symposium on Principles of Programming Languages, New York, 1993, ACM.
D. Leivant, Ramified recurrence and computational complexity I: word recurrence and polytime, in P. Clote and J. Remmel (eds), Feasible Mathematics II (Birkauser, 1994), 320–343.
D. Leivant and J.-Y. Marion, Ramified recurrence and computational complexity II: substitution and polyspace, in J. Tiuryn and L. Pocholsky (eds), Computer Science Logic, LNCS 933(1995) 486–500.
I. Oitavem, New recursive characterization of the elementary functions and the functions computable in polynomial space, Revista Matematica de la Universidad Complutense de Madrid, 101(1997)109–125.
R.W. Ritchie, Classes of predictable computable functions, Transactions of A.M.S., 106, 1993.
H.E. Rose, Subrecursion: Functions and hierarchies, Oxford University Press, Oxford, 1984.
H. Simmons, The realm of primitive recursion, Arch.Math. Logic, 27(1988)177–188.
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2000 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Covino, E., Pani, G., Caporaso, S. (2000). Extending the Implicit Computational Complexity Approach to the Sub-elementary Time-Space Classes. In: Bongiovanni, G., Petreschi, R., Gambosi, G. (eds) Algorithms and Complexity. CIAC 2000. Lecture Notes in Computer Science, vol 1767. Springer, Berlin, Heidelberg. https://doi.org/10.1007/3-540-46521-9_20
Download citation
DOI: https://doi.org/10.1007/3-540-46521-9_20
Published:
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-67159-6
Online ISBN: 978-3-540-46521-8
eBook Packages: Springer Book Archive